Every K-1,K-7 and K-1,K-3-free, 3-vertex critical graph of even order has a perfect matching

被引:2
|
作者
Kazemi, Adel P. [1 ]
机构
[1] Univ Mohaghegh Ardabili, Dept Math, POB 5619911367, Ardebil, Iran
关键词
Vertex-critical graph; perfect matching;
D O I
10.1080/09720529.2010.10698316
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Ananchuen and Plummer in Matchings in 3-vertex-critical graphs: the even case, Networks, Vol. 45 (4) (2005), pp. 210-213] began the study of matchings in 3-vertex-critical graphs. They showed that any 3-vertex-critical graph on an even number of vertices which is K-1,K-5-free must have a perfect matching. Also they conjectured that this is also true when G is K-1,K-7-free. In the present paper we prove this conjecture when G is triangle-free.
引用
收藏
页码:583 / 591
页数:9
相关论文
共 50 条