%0 Journal Article
%T Star subdivisions and connected even factors in the square of a graph
%A Jan Ekstein
%A P£¿emysl Holub
%A Tom¨¢£¿ Kaiser
%A Liming Xiong
%A Shenggui Zhang
%J Mathematics
%D 2012
%I arXiv
%X 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(K_{1, 2s+1})$ in a graph $G$ has at least 3 edges in a block of degree at most two, then $G^2$ has a $[2,2s]$-factor. This extends the results of Hendry and Vogler and of Abderrezzak et al.
%U http://arxiv.org/abs/1206.4825v1