Connected even factors in claw-free graphs (Q2483413): Difference between revisions

A graph \(G\) is \(K_{1,k}\)-free if no induced subgraph of \(G\) is isomorphic to \(K_{1,k}\), and is supereulerian if it contains a spanning closed trail. A connected even \([2,2s]\)-factor of \(G\) is a connected factor with all vertices of degree \(i\;(i=2,4,\dots,2s)\) where \(s\geq1\) is an integer. It is proved that every supereulerian \(K_{1,k}\)-free graph (\(k\geq2\)) contains a connected even \([2,2k-2]\)-factor. This result generalizes analogous result by \textit{H. J. Broersma, M. Kriesell} and \textit{Z. Ryjacek} [``On factors of 4-connected claw-free graphs'', J. Graph Theory 37, No.~2, 125--136 (2001; Zbl 0984.05067)] for \(k=3\).