Connected even factors in claw-free graphs

被引:6
|
作者
Lia, MingChu [1 ,2 ]
Xiong, Liming [3 ]
Broersma, H. J. [4 ]
机构
[1] Chongqing Technol & Business Univ, Coll Sci, Chongqing 400067, Peoples R China
[2] Dalian Univ Technol, Sch Software, Dalian 116620, Peoples R China
[3] Beijing Inst Technol, Dept Appl Math, Beijing 100081, Peoples R China
[4] Univ Durham, Dept Comp Sci, Durham DH1 3LE, England
基金
中国国家自然科学基金;
关键词
connected even factor; cycle; claw-free graph;
D O I
10.1016/j.disc.2007.04.058
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A connected even [2, 2s]-factor of a graph G is a connected factor with all vertices of degree i (i = 2, 4,..., 2s), where s >= 1 is an integer. In this paper, we show that every supereulerian K-1,K-s -free graph (s >= 2) contains a connected even [2, 2s - 2]-factor, hereby generalizing the result that every 4-connected claw-free graph has a connected [2, 4]-factor by Broersma, Kriesell and Ryjacek. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:2282 / 2284
页数:3
相关论文
共 50 条
  • [1] The structure of even factors in claw-free graphs
    Xiong, Liming
    Lu, Mei
    Han, Longsheng
    DISCRETE MATHEMATICS, 2009, 309 (08) : 2417 - 2423
  • [2] A NOTE ON CONNECTED FACTORS IN CLAW-FREE GRAPHS
    XU Baoguang
    JournalofSystemsScienceandComplexity, 2001, (01) : 91 - 92
  • [3] Closure operation for even factors on claw-free graphs
    Xiong, Liming
    DISCRETE MATHEMATICS, 2011, 311 (16) : 1714 - 1723
  • [4] On factors of 4-connected claw-free graphs
    Broersma, HJ
    Kriesell, M
    Ryjácek, Z
    JOURNAL OF GRAPH THEORY, 2001, 37 (02) : 125 - 136
  • [5] Hamiltonian Connected Claw-Free Graphs
    MingChu Li
    Graphs and Combinatorics, 2004, 20 : 341 - 362
  • [6] Even factors with degree at most four in claw-free graphs
    Wu, Qiuxin
    Xiong, Liming
    Wu, Tingzeng
    COMPUTATIONAL SCIENCE - ICCS 2007, PT 3, PROCEEDINGS, 2007, 4489 : 397 - +
  • [7] Quadrangularly connected claw-free graphs
    Li, MingChu
    Guo, Cheng
    Xiong, Liming
    Li, Dengxin
    Lai, Hong-Jian
    DISCRETE MATHEMATICS, 2007, 307 (9-10) : 1205 - 1211
  • [8] Hamiltonian connected claw-free graphs
    Li, M
    GRAPHS AND COMBINATORICS, 2004, 20 (03) : 341 - 362
  • [9] FACTORS OF CLAW-FREE GRAPHS
    LONC, Z
    RYJACEK, Z
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 1991, 41 (01) : 120 - 130
  • [10] Panconnectivity of locally connected claw-free graphs
    Discrete Math, 1-3 (253-260):