Computing Sharp 2-Factors in Claw-Free Graphs


In a recently submitted paper we obtained an upper bound for the minimum number of components of a 2-factor in a claw-free graph. This bound is sharp in the sense that there exist infinitely many claw-free graphs for which the bound is tight. In this paper we extend these results by presenting a polynomial algorithm that constructs a 2-factor of a claw-free… (More)
DOI: 10.1007/978-3-540-85238-4_15