A note on minimal matching covered graphs
arXiv:0707.1925 · doi:10.1016/j.disc.2005.12.006
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.
4 pages
Cited by in corpus (6)
- On disjoint matchings in cubic graphs
- On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs
- On Edge-Disjoint Pairs Of Matchings
- Characterization Of A Class Of Graphs Related To Pairs Of Disjoint Matchings
- The Complexity of Determining Existence a Hamiltonian Cycle is
- On a constructive characterization of a class of trees related to pairs of disjoint matchings