Star subdivisions and connected even factors in the square of a graph

Jan Ekstein, Přemysl Holub, Tomáš Kaiser +2

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 gra…