Planar cycle-extendable graphs
Abstract: For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching. There is extensive literature on these graphs that are also known as 1-extendable graphs (since each edge extends to a perfect matching) including an ear decomposition theorem due to Lov\'asz and Plummer. A cycle $C$ of a graph $G$ is conformal if $G-V(C)$ has a perfect matching; such cycles play an important role in the study of perfect matchings, especially when investigating the Pfaffian orientation problem. A matching covered graph $G$ is cycle-extendable if - for each even cycle $C$ - the cycle $C$ is conformal, or equivalently, each perfect matching of $C$ extends to a perfect matching of $G$, or equivalently, $C$ is the symmetric difference of two perfect matchings of $G$, or equivalently, $C$ extends to an ear decomposition of $G$. In the literature, these are also known as cycle-nice or as 1-cycle resonant graphs. Zhang, Wang, Yuan, Ng and Cheng, 2022, provided a characterization of claw-free cycle-extendable graphs. Guo and Zhang, 2004, and independently Zhang and Li, 2012, provided characterizations of bipartite planar cycle-extendable graphs. In this paper, we establish a characterization of all planar cycle-extendable graphs - in terms of $K_2$ and four infinite families.
- Graph Theory. Springer, 2008.
- Vector spaces and the petersen graph. The Electronic J. of Combin., 15(#R9), 2008.
- Optimal ear decompositions of matching covered graphs. J. Combin. Theory Ser. B, 85:59–93, 2002.
- How to build a brick. Discrete Math., 306:2383–2410, 2006.
- Thin edges in braces. The Electronic J. of Combin., 22, 2015.
- Critically n-connected graphs. Proceedings of the American Mathematical Society, 32:63–68, 1972.
- Reducible chains of planar 1-cycle resonant graphs. Discrete Mathematics, 275:1-3, 2004.
- A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs. Discrete Applied Mathematics, 160:7-8:1277–1280, 2012.
- N. Kothari and U. S. R. Murty. K4subscript𝐾4{K}_{4}italic_K start_POSTSUBSCRIPT 4 end_POSTSUBSCRIPT-free and C6¯¯subscript𝐶6\overline{C_{6}}over¯ start_ARG italic_C start_POSTSUBSCRIPT 6 end_POSTSUBSCRIPT end_ARG-free planar matching covered graphs. J. Graph Theory, 82(1):5–32, 2016.
- C. H. C. Little. A characterization of convertible (0,1)01(0,1)( 0 , 1 )-matrices. J. Combin. Theory Ser. B, 18:187–208, 1975.
- L. Lovász. Matching structure and the matching lattice. J. Combin. Theory Ser. B, 43:187–222, 1987.
- L. Lovász and M. D. Plummer. Matching Theory. Number 29 in Annals of Discrete Mathematics. Elsevier Science, 1986.
- Perfect Matchings. Springer, 2022.
- W. McCuaig. Pólya’s permanent problem. The Electronic J. of Combin., 11:R79, 2004.
- S. Norine and R. Thomas. Generating bricks. J. Combin. Theory Ser. B, 97:769–817, 2007.
- Kapil R Shenvi Pause. On planar cycle-extendable graphs. Master’s thesis, Chennai Mathematical Intitute, 2022.
- M. D. Plummer. Extending matchings in graphs: A survey. Discrete Mathematics, 127:277–292, 1991.
- Permanents, Pfaffian orientations and even directed circuits. Ann. of Math. (2), 150:929–975, 1999.
- H. Whitney. 2-isomorphic graphs. American Journal of Mathematics, 57:245–254, 1933.
- Computing the permanental polynomials of bipartite graphs by pfaffian orientation. Discrete Applied Mathematics, 160:13-14:2069–2074, 2012.
- On cycle-nice claw-free graphs. Discrete Mathematics, 345-7:112876, 2022.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.