A note on minimal matching covered graphs

被引：5

作者：

Mkrtchyan, V. V. ^{[1
]}

机构：

[1] Yerevan State Univ, Dept Informat & Appl Math, Yerevan 375025, Armenia

来源：

DISCRETE MATHEMATICS | 2006年 / 306卷 / 04期

关键词：

maximum matching; matching covered graph; minimal matching covered graph; perfect matching;

D O I：

10.1016/j.disc.2005.12.006

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. (c) 2006 Elsevier B.V. All rights reserved.

引用

页码：452 / 455

页数：4