@inproceedings{f1c37ae6529146c6ba597619b379269c,

title = "On components of 2-factors in claw-free graphs",

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$.",

keywords = "IR-62062, METIS-245869, EWI-11587",

author = "Broersma, {Haitze J.} and Dani{\"e}l Paulusma and K. Yoshimoto",

note = "10.1016/j.endm.2007.07.050 ",

year = "2007",

month = aug,

doi = "10.1016/j.endm.2007.07.050",

language = "Undefined",

series = "Electronic Notes in Discrete Mathematics",

publisher = "Elsevier",

number = "1",

pages = "289--293",

booktitle = "EuroComb 2007: European Conference on Combinatorics, Graph Theory and Applications",

}