2-factors in claw-free graphs

@article{GuantaoChen2000,
abstract = {We 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. (By claw-free we mean the graph has no induced $K_\{1,3\}$.) In particular, we show that for such a graph G of order n ≥ 51 with δ(G) ≥ (n-2)/3, G contains a 2-factor with exactly k cycles, for 1 ≤ k ≤ (n-24)/3. We also show that this result is sharp in the sense that if we lower δ(G), we cannot obtain the full range of values for k.},
author = {Guantao Chen, Jill R. Faudree, Ronald J. Gould, Akira Saito},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {claw-free; forbidden subgraphs; 2-factors; cycles},
language = {eng},
number = {2},
pages = {165-172},
title = {2-factors in claw-free graphs},
url = {http://eudml.org/doc/270284},
volume = {20},
year = {2000},
}

TY - JOUR
AU - Guantao Chen
AU - Jill R. Faudree
AU - Ronald J. Gould
AU - Akira Saito
TI - 2-factors in claw-free graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2000
VL - 20
IS - 2
SP - 165
EP - 172
AB - We 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. (By claw-free we mean the graph has no induced $K_{1,3}$.) In particular, we show that for such a graph G of order n ≥ 51 with δ(G) ≥ (n-2)/3, G contains a 2-factor with exactly k cycles, for 1 ≤ k ≤ (n-24)/3. We also show that this result is sharp in the sense that if we lower δ(G), we cannot obtain the full range of values for k.
LA - eng
KW - claw-free; forbidden subgraphs; 2-factors; cycles
UR - http://eudml.org/doc/270284
ER -