Paper Info
Title
2-factors in claw-free graphs.
Abstract
A graph G is said to be claw-free if G has no induced subgraph isomorphic to K1,3. We study about the minimum length of cycles in 2-factors of claw-free graphs, and we show that every claw-free graph G with minimum degree δ⩾4 has a 2-factor in which each cycle contains at least ⌈δ−12⌉ vertices and every 2-connected claw-free graph G with δ⩾3 has a 2-factor in which each cycle contains at least δ vertices.
Year
DOI
Venue
2011
10.1016/j.endm.2011.09.036
Electronic Notes in Discrete Mathematics
Keywords
Field
DocType
2-factor,Claw-free,Minimum degree
Pseudoforest,Discrete mathematics,Combinatorics,Graph toughness,Graph power,Cycle graph,Induced subgraph,Factor-critical graph,Universal graph,Pancyclic graph,Mathematics
Journal
Volume
ISSN
Citations 
38
1571-0653
0
PageRank 
References 
Authors
0.34
7
3
Name
Order
Citations
PageRank
Roman Cada1408.35
Shuya Chiba23512.93
Kiyoshi Yoshimoto313322.65