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 条
12345