# On 2-factors in claw-free graphs

- Authors
- Journal
- Discrete Mathematics 0012-365X
- Publisher
- Elsevier
- Publication Date
- Volume
- 206
- Identifiers
- DOI: 10.1016/s0012-365x(98)00398-7
- Disciplines

## Abstract

Abstract A graph is said claw-free if it contains no induced subgraph isomorphic to K 1,3. We prove that if G is a claw-free graph with minimum degree δ⩾4, then G contains a 2-factor with at most 6 n/( δ+2)−1 components. Moreover, together with a theorem of Choudoum and Paulraj (J. Graph Theory 15 (1991) 259–265) and one of Anstee (J. Algorithms 6 (1985) 112–131), it is polynomial (in O( n 3)) to construct such a 2-factor.

## There are no comments yet on this publication. Be the first to share your thoughts.