论文信息 - Extending matchings in planar graphs IV

Extending matchings in planar graphs IV

Abstract The structure of certain non-2-extendable planar graphs is studied first. In particular, 4-connected 5-regular planar graphs which are not 2-extendable are investigated and examples of these are presented. It is then proved that all 5-connected even planar graphs are 2-extendable. Finally, a certain configuration called a generalized butterfly is defined and it is shown that 4-connected maximal planar even graphs which contain no generalized butterfly are 2-extendable.

Michael D. Plummer

[1] W. T. Tutte. A THEOREM ON PLANAR GRAPHS , 1956 .

[2] Dingjun Lou,et al. On the 2-extendability of planar graphs , 1991, Discret. Math..

[3] W. T. Tutte. The Factorization of Linear Graphs , 1947 .

[4] Carsten Thomassen,et al. A theorem on paths in planar graphs , 1983, J. Graph Theory.

[5] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[6] M. Plummer. A Theorem on Matchings in the Plane , 1988 .

[7] Michael D. Plummer,et al. On n-extendable graphs , 1980, Discret. Math..

[8] Allan B. Cruse. A note on 1-factors in certain regular multigraphs , 1977, Discret. Math..