TY - JOUR
T1 - Connected even factors in claw-free graphs
AU - Li, Ming Chu
AU - Xiong, Liming
AU - Broersma, H. J.
PY - 2008/6/6
Y1 - 2008/6/6
N2 - A connected even [2, 2 s]-factor of a graph G is a connected factor with all vertices of degree i (i = 2, 4, ..., 2 s), where s ≥ 1 is an integer. In this paper, we show that every supereulerian K1, s-free graph (s ≥ 2) contains a connected even [2, 2 s - 2]-factor, hereby generalizing the result that every 4-connected claw-free graph has a connected [2, 4]-factor by Broersma, Kriesell and Ryjacek.
AB - A connected even [2, 2 s]-factor of a graph G is a connected factor with all vertices of degree i (i = 2, 4, ..., 2 s), where s ≥ 1 is an integer. In this paper, we show that every supereulerian K1, s-free graph (s ≥ 2) contains a connected even [2, 2 s - 2]-factor, hereby generalizing the result that every 4-connected claw-free graph has a connected [2, 4]-factor by Broersma, Kriesell and Ryjacek.
KW - Claw-free graph
KW - Connected even factor
KW - Cycle
UR - http://www.scopus.com/inward/record.url?scp=40649091123&partnerID=8YFLogxK
U2 - 10.1016/j.disc.2007.04.058
DO - 10.1016/j.disc.2007.04.058
M3 - Article
AN - SCOPUS:40649091123
SN - 0012-365X
VL - 308
SP - 2282
EP - 2284
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 11
ER -