Claw-free minimal matching covered graphs
Yipei Zhang, Xiumei Wang, Jinjiang Yuan, C.T. Ng, T.C.E. Cheng

TL;DR
This paper characterizes claw-free minimal matching covered graphs, extending known results, and analyzes removable edges in cubic claw-free matching covered graphs, establishing a sharp lower bound.
Contribution
It provides a complete characterization of claw-free minimal matching covered graphs and analyzes removable edges in cubic claw-free graphs, including a sharp bound.
Findings
Characterization of claw-free minimal matching covered graphs
Number of removable edges in cubic claw-free matching covered graphs
At least 12 removable edges in certain graphs, with sharp bound
Abstract
A matching covered graph is minimal if for each edge of , is not matching covered. An edge of a matching covered graph is removable if is also matching covered. Thus a matching covered graph is minimal if and only if it is free of removable edges. For bipartite graphs, Lov\'{a}sz and Plummer gave a characterization of bipartite minimal matching covered graphs. For bricks, Lov\'{a}sz showed that the only bricks that are minimal matching covered are and . In this paper, we present a complete characterization of minimal matching covered graphs that are claw-free. Moreover, for cubic claw-free matching covered graphs that are not minimal matching covered, we obtain the number of their removable edges (with respect to their bricks), and then prove that they have at least 12 removable edges (the bound is sharp).
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 · Complexity and Algorithms in Graphs · Limits and Structures in Graph Theory
