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 条
  • [31] Factors with Red–Blue Coloring of Claw-Free Graphs and Cubic Graphs
    Michitaka Furuya
    Mikio Kano
    Graphs and Combinatorics, 2023, 39
  • [32] Hourglasses and Hamilton cycles in 4-connected claw-free graphs
    Kaiser, T
    Li, MC
    Ryjacek, Z
    Xiong, LM
    JOURNAL OF GRAPH THEORY, 2005, 48 (04) : 267 - 276
  • [33] Circumferences and minimum degrees in 3-connected claw-free graphs
    Li, MingChu
    Cui, Yongrui
    Xiong, Liming
    Tian, Yuan
    Jiang, He
    Yuan, Xu
    DISCRETE MATHEMATICS, 2009, 309 (11) : 3580 - 3587
  • [34] Hamiltonian Cycles in Regular 2-Connected Claw-Free Graphs
    李明楚
    Transactions of Tianjin University, 2003, (04) : 273 - 278
  • [35] Computing sharp 2-factors in claw-free graphs
    Broersma, Hajo
    Paulusma, Daniel
    JOURNAL OF DISCRETE ALGORITHMS, 2010, 8 (03) : 321 - 329
  • [36] Pancyclicity of claw-free hamiltonian graphs
    Trommel, H
    Veldman, HJ
    Verschut, A
    DISCRETE MATHEMATICS, 1999, 197 (1-3) : 781 - 789
  • [37] Circumferences of regular claw-free graphs
    Li, MingChu
    DISCRETE MATHEMATICS, 2006, 306 (21) : 2682 - 2694
  • [38] Counting claw-free cubic graphs
    Palmer, Edgar M.
    Read, Ronald C.
    Robinson, Robert W.
    2003, Society for Industrial and Applied Mathematics Publications (16) : 65 - 73
  • [39] 2-factors and independent sets on claw-free graphs
    Kuzel, Roman
    Ozeki, Kenta
    Yoshimoto, Kiyoshi
    DISCRETE MATHEMATICS, 2012, 312 (02) : 202 - 206
  • [40] Closure concept for 2-factors in claw-free graphs
    Ryjacek, Zdenek
    Xiong, Liming
    Yoshimoto, Kiyoshi
    DISCRETE MATHEMATICS, 2010, 310 (10-11) : 1573 - 1579