The main result of the paper says that in every 2-connected claw-free graph there is a 2-factor such that the lenght of the longest cycle in it is at least 2d+4, where d is the minimum degree of the graph. This is proved for d at least 7.
The main result of the paper says that in every 2-connected claw-free graph there is a 2-factor such that the lenght of the longest cycle in it is at least 2d+4, where d is the minimum degree of the graph. This is proved for d at least 7. (en)