TL;DR
This paper investigates the properties of minimal matching covered graphs, demonstrating that such graphs necessarily contain a perfect matching, thereby contributing to the understanding of their structural characteristics.
Contribution
The paper establishes that minimal matching covered graphs always contain a perfect matching, providing new insight into their structural properties.
Findings
Minimal matching covered graphs contain a perfect matching.
The study clarifies the structural properties of matching covered graphs.
Provides theoretical insights into graph matchings.
Abstract
A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.
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.