TY - JOUR
T1 - Star subdivisions and connected even factors in the square of a graph
AU - Ekstein, Jan
AU - Holub, Pemysl
AU - Kaiser, Tomáš
AU - Xiong, Liming
AU - Zhang, Shenggui
PY - 2012/9/6
Y1 - 2012/9/6
N2 - For any positive integer s, a [2,2s]-factor in a graph G is a connected even factor with maximum degree at most 2s. We prove that if every induced S(K1,2s+1) in a graph G has at least three edges in a block of degree at most 2, then G2 has a [2,2s]-factor. This extends the results of Hendry and Vogler [5] and Abderrezzak et al. (1991) [1].
AB - For any positive integer s, a [2,2s]-factor in a graph G is a connected even factor with maximum degree at most 2s. We prove that if every induced S(K1,2s+1) in a graph G has at least three edges in a block of degree at most 2, then G2 has a [2,2s]-factor. This extends the results of Hendry and Vogler [5] and Abderrezzak et al. (1991) [1].
KW - Connected even factor
KW - Square of a graph
UR - http://www.scopus.com/inward/record.url?scp=84862661331&partnerID=8YFLogxK
U2 - 10.1016/j.disc.2011.09.004
DO - 10.1016/j.disc.2011.09.004
M3 - 文章
AN - SCOPUS:84862661331
SN - 0012-365X
VL - 312
SP - 2574
EP - 2578
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 17
ER -