A note on minimal matching covered graphs

Simple item page
dc.creatorMkrtchyan, V. V.
dc.date2007-07-13
dc.date.accessioned2026-07-07T08:17:32Z
dc.date.available2026-07-07T08:17:32Z
dc.descriptionA 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.
dc.description4 pages
dc.identifierhttps://arxiv.org/abs/0707.1925
dc.identifierhttp://arxiv.org/abs/0707.1925
dc.identifierDiscrete Mathematics 306, (2006), pp. 452-455
dc.identifierdoi:10.1016/j.disc.2005.12.006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134124
dc.subjectDiscrete Mathematics
dc.titleA note on minimal matching covered graphs
dc.typetext

Files

Collections

arXiv