2-factors and independent sets on claw-free graphs

Roman Kužel, Kenta Ozeki, Kiyoshi Yoshimoto
2012 Discrete Mathematics  
In this paper, we show that if G is an l-connected claw-free graph with minimum degree at least three and l ∈ {2, 3}, then for any maximum independent set S, there exists a 2-factor in which each cycle contains at least l − 1 vertices in S. Crown
doi:10.1016/j.disc.2011.08.020 fatcat:erof4jbzdfhhrloynfgbuclzva