Title of article
A note on minimal matching covered graphs
Author/Authors
V.V. Mkrtchyan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
4
From page
452
To page
455
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 without isolated vertices contain a perfect matching.
Keywords
Maximum Matching , Minimal matching covered graph , Perfect matching , Matching covered graph
Journal title
Discrete Mathematics
Serial Year
2006
Journal title
Discrete Mathematics
Record number
948196
Link To Document