2-factors and independent sets on claw-free graphs

In this paper, we show that if GG is an ll-connected claw-free graph with minimum degree at least three and l∈{2,3}l∈{2,3}, then for any maximum independent set SS, there exists a 2-factor in which each cycle contains at least l−1l−1 vertices in SS.