|
|||||
|
|
A note on minimal matching covered graphs |
|
| Authors: | VV Mkrtchyan |
| Institution: | Department of Informatics and Applied Mathematics, Yerevan State University, Yerevan 375025, Armenia |
| 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 Matching covered graph Minimal matching covered graph Perfect matching |
| 本文献已被 ScienceDirect 等数据库收录！ | |