# On components of 2-factors in claw-free graphs

Haitze J. Broersma, Daniël Paulusma, K. Yoshimoto

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

## Abstract

For a non-hamiltonian claw-free graph $G$ with order $n$ and minimum degree $\delta$ we show the following. 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 $\delta \ge 5$, then $G$ has a 2-factor with at most $(n-3)/(\delta -1)$ components. These bounds are sharp in the sense that we can replace nor 5/18 by a smaller quotient nor $\delta -1$ by $\delta$.
Original language Undefined EuroComb 2007: European Conference on Combinatorics, Graph Theory and Applications Amsterdam Elsevier 289-293 5 https://doi.org/10.1016/j.endm.2007.07.050 Published - Aug 2007

### Publication series

Name Electronic Notes in Discrete Mathematics Elsevier 1 29 1571-0653 1571-0653

• IR-62062
• METIS-245869
• EWI-11587