Abstract
Let $G$ be a claw-free graph with order $n$ and minimum degree $\delta$. We improve results of Faudree et al. and Gould & Jacobson, and solve two open problems by proving the following two results. If $\delta = 4$, then $G$ has a 2-factor with at most $(5n - 14)/ 18$ components, unless $G$ belongs to a finite class of exceptional graphs. If $\delts \ge 5$, then $G$ has a 2-factor with at most $(n - 3)/(\delta - 1)$ components, unless $G$ is a complete graph. These bounds are best possible in the sense that we cannot replace 5/18 by a smaller quotient and we cannot replace $\delta - 1$ by $\delta$, respectively.
Original language | Undefined |
---|---|
Article number | 10.1007/s00373-009-0855-7 |
Pages (from-to) | 427-460 |
Number of pages | 34 |
Journal | Graphs and combinatorics |
Volume | 25 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2009 |
Keywords
- EWI-17516
- IR-70041
- METIS-265816