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