On traceability and 2-factors in claw-free graphs
Dalibor Fronček, Zdeněk Ryjáček, Zdzisław Skupień (2004)
Discussiones Mathematicae Graph Theory
Similarity:
If G is a claw-free graph of sufficiently large order n, satisfying a degree condition σₖ > n + k² - 4k + 7 (where k is an arbitrary constant), then G has a 2-factor with at most k - 1 components. As a second main result, we present classes of graphs ₁,...,₈ such that every sufficiently large connected claw-free graph satisfying degree condition σ₆(k) > n + 19 (or, as a corollary, δ(G) > (n+19)/6) either belongs to or is traceable.