id: 01618903
dt: j
an: 01618903
au: Chen, Guantao; Faudree, Jill R.; Gould, Ronald J.; Saito, Akira
ti: 2-factors in claw-free graphs.
so: Discuss. Math., Graph Theory 20, No.2, 165-172 (2000).
py: 2000
pu: University of Zielona Góra Press, Zielona Góra
la: EN
cc: 
ut: claw-free; forbidden subgraphs; 2-factors; cycles
ci: 
li: doi:10.7151/dmgt.1116 http://www.pz.zgora.pl/discuss/gt/20_2/g1.htm
ab: The authors consider the question of the range of the number of cycles
    possible in a 2-factor of a 2-connected claw-free graph with
    sufficiently high minimum degree. In particular they show that for such
    a graph $G$ of order $n\geq 51$ with $δ(G)\geq \frac{n-2}{3}$, $G$
    contains a 2-factor with exactly $k$ cycles, for $1\leq k \leq
    \frac{n-24}{3}$. They also show that this result is sharp in the sense
    that if $δ(G)$ is lowered one cannot obtain the full range of values
    for $k$.
rv: Stanislav Jendrol’ (Košice)