A note on minimal matching covered graphs
classification
💻 cs.DM
keywords
matchingcoveredgraphsminimalcalledcontaincontainingedge
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.