A note on minimal matching covered graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Discrete Mathematics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134124

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0707.1925
 http://arxiv.org/abs/0707.1925
 Discrete Mathematics 306, (2006), pp. 452-455
 doi:10.1016/j.disc.2005.12.006

Collections

arXiv