Two-factors with few cycles in claw-free graphs (Q5937588)

The authors improve a result of \textit{R. Faudree, O. Favaron, E. Flandrin, H. Li}, and \textit{Z. Liu} [On \(2\)-factors in claw-free graphs, Discrete Math. 206, No. 1-3, 131-137 (1999; Zbl 0981.05084)]. Namely, it is proved that any claw-free graph \(G\) with sufficiently many vertices contains a \(2\)-factor with at most \(n/\delta\) cycles, where \(n\) is the number of vertices of \(G\) and \(\delta\) is the minimum degree in \(G\) (a claw-free graph is one that does not span a subgraph isomorphic to \(K_{1,3}\)).