On the number of components in 2-factors of claw-free graphs (Q2461206): Difference between revisions

The author proves that every bridgeless claw-free graph \(G\) with the minimum degree \(\delta\geq 4\) has a 2-factor with at most \((n-1)/4\) components, where \(n\) is the order of \(G\). This upper bound is best possible. Additionally, a family of claw-free graphs with minimum degree \(\delta\geq 4\) in which every 2-factor contains more than \(n/\delta\) components is constructed.