On non-planar, cycle-conformal graphs
Maximilian Gorsky, Clemens Kuske

TL;DR
This paper characterizes non-planar, bipartite, and cubic cycle-conformal graphs, extending previous planar results, and identifies key structural building blocks like $K_{3,3}$ and $C_4$.
Contribution
It provides the first complete characterization of non-planar, cycle-conformal, bipartite, and Pfaffian graphs, identifying fundamental building blocks and proposing a conjecture for regular braces.
Findings
$C_4$ is the only Pfaffian, cycle-conformal brace.
$K_{3,3}$ is the only cubic, cycle-conformal brace.
Characterizations facilitate understanding of matching covered graphs.
Abstract
A graph is called matching covered if all of its edges are contained in some perfect matching of . Furthermore, a cycle is called conformal if has a perfect matching and itself is called cycle-conformal if all of its even cycles are conformal. Both matching covered graphs and conformal cycles play central roles in matching theory. After a string of results from various authors, focused mainly on bipartite, planar graphs and claw-free graphs, a complete characterisation of all planar, cycle-conformal graphs has recently been presented by Dalwadi, Pause, Diwan, and Kothari [DMTCS, 2025]. We continue this exploration further into the realm of non-planar graphs, giving a characterisation of matching covered, cycle-conformal graphs that are bipartite and cubic, and respectively, those that are bipartite and Pfaffian. The last class plays a fundamental…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph theory and applications
