A note on minimal matching covered graphs
Discrete Mathematics
2007-07-16 v1
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.
Cite
@article{arxiv.0707.1925,
title = {A note on minimal matching covered graphs},
author = {V. V. Mkrtchyan},
journal= {arXiv preprint arXiv:0707.1925},
year = {2007}
}
Comments
4 pages