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
来源：
DISCRETE MATHEMATICS | 2008年 / 308卷 / 11期
基金：
中国国家自然科学基金;
关键词：
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] Hamiltonicity in 3-connected claw-free graphs
    Lai, Hong-Jian
    Shao, Yehong
    Zhan, Mingquan
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2006, 96 (04) : 493 - 504
  • [32] PANCONNECTIVITY AND 2-CONNECTED CLAW-FREE GRAPHS
    GAO Jingzhen(Department of Mathematics
    SystemsScienceandMathematicalSciences, 1996, (01) : 5 - 12
  • [33] On 1-Hamilton-connected claw-free graphs
    Kaiser, Tomas
    Ryjacek, Zdenek
    Vrana, Petr
    DISCRETE MATHEMATICS, 2014, 321 : 1 - 11
  • [34] On 2-factors in 5-cycle connected claw-free graphs
    Tian, Runli
    An, Mingqiang
    UTILITAS MATHEMATICA, 2017, 102 : 161 - 168
  • [35] On f-factors in claw-free graphs
    Fourtounelli, Olga
    Katerinis, P.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2012, 52 : 133 - 140
  • [36] ON 2-FACTORS IN CLAW-FREE GRAPHS
    LI Guojun(Mathematics Department
    SystemsScienceandMathematicalSciences, 1995, (04) : 369 - 372
  • [37] Critical Graphs for Subpancyclicity of 3-Connected Claw-Free Graphs
    Gould, Ronald J.
    Luczak, Tomasz
    Pfender, Florian
    JOURNAL OF GRAPH THEORY, 2009, 62 (03) : 263 - 278
  • [38] 9-connected claw-free graphs are Hamilton-connected
    Brandt, S
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1999, 75 (02) : 167 - 173
  • [39] Even cycles and perfect matchings in claw-free plane graphs
    Zhang, Shanshan
    Wang, Xiumei
    Yuan, Jinjiang
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2020, 22 (04):
  • [40] Quasilocally connected, almost locally connected or triangularly connected claw-free graphs
    Qu, Xiaoying
    Lin, Houyuan
    DISCRETE GEOMETRY, COMBINATORICS AND GRAPH THEORY, 2007, 4381 : 162 - +
12345