Paper Info
Title
On the number of components in 2-factors of claw-free graphs
Abstract
In this paper, we prove that if a claw-free graph G with minimum degree @d>=4 has no maximal clique of two vertices, then G has a 2-factor with at most (|G|-1)/4 components. This upper bound is best possible. Additionally, we give a family of claw-free graphs with minimum degree @d>=4 in which every 2-factor contains more than n/@d components.
Year
DOI
Venue
2007
10.1016/j.disc.2006.11.022
Discrete Mathematics
Keywords
Field
DocType
claw-free graphs,line graphs,2-factor,line graph,claw free graph,upper bound
Discrete mathematics,Claw,Combinatorics,Line graph,Vertex (geometry),Claw-free graph,Clique,Upper and lower bounds,Chordal graph,Clique-sum,Mathematics
Journal
Volume
Issue
ISSN
307
22
Discrete Mathematics
Citations 
PageRank 
References 
11
0.65
9
Authors
1
Name
Order
Citations
PageRank
Kiyoshi Yoshimoto113322.65