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 条
  • [1] On K-1,K-3-free strictly Deza graphs
    Mityanina, A., V
    [J]. TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2016, 22 (01): : 231 - 234
  • [2] Supertough graphs need not he K-1,K-3-free
    Doty, Lynne L.
    Ferland, Kevin K.
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2005, 32 : 91 - 103
  • [3] K-1,K-3-free and W-4-free graphs
    Kloks, T
    [J]. INFORMATION PROCESSING LETTERS, 1996, 60 (04) : 221 - 223
  • [4] On K-1,K-3-free Deza graphs with diameter greater than 2
    Mityanina, A. V.
    [J]. TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2014, 20 (02): : 238 - 241
  • [5] ON UNIFORMLY RESOLVABLE {K-1,K-2, K-1,K-3}-DESIGNS
    Lo Faro, Giovanni
    Milici, Salvatore
    Tripodi, Antoinette
    [J]. ATTI ACCADEMIA PELORITANA DEI PERICOLANTI-CLASSE DI SCIENZE FISICHE MATEMATICHE E NATURALI, 2018, 96 : A91 - A97
  • [6] K K,K IS (K-1, 1)-CRITICAL FOR K-REGULAR K-CONNECTED GRAPHS
    ALDRED, REL
    JIA, RZ
    [J]. ARS COMBINATORIA, 1988, 26B : 247 - 248
  • [7] Conversion of vitamin K-1 to 2',3'-dihydrovitamin K-1 during the hydrogenation of vegetable oils
    Davidson, KW
    Booth, SL
    Dolnikowski, GG
    Sadowski, JA
    [J]. JOURNAL OF AGRICULTURAL AND FOOD CHEMISTRY, 1996, 44 (04) : 980 - 983
  • [8] On the family of diophantine triples (k-1, k+1, 16k3-4k)
    Bugeaud, Yann
    Dujella, Andrej
    Mignotte, Maurice
    [J]. GLASGOW MATHEMATICAL JOURNAL, 2007, 49 : 333 - 344
  • [9] SOME REMARKS ON (K-1)-CRITICAL SUBGRAPHS OF K-CRITICAL GRAPHS
    ABBOTT, HL
    ZHOU, B
    [J]. COMBINATORICA, 1995, 15 (04) : 469 - 474
  • [10] ON THE INDEPENDENCE NUMBER IN K-1,K-R+1-FREE GRAPHS
    RYJACEK, Z
    SCHIERMEYER, I
    [J]. DISCRETE MATHEMATICS, 1995, 138 (1-3) : 365 - 374