2-factors in claw-free graphs with lower bounds cycle lengths

DOI10.1007/S00373-013-1375-ZzbMath1306.05033OpenAlexW2070267812MaRDI QIDQ489345

Shuya Chiba, Roman Čada, Kiyoshi Yoshimoto

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1375-z

zbMATH Keywords

2-factorclaw-free graphminimum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (1)

2-factors with bounded number of components in claw-free graphs

Cites Work

• Unnamed Item
• 2-factors and independent sets on claw-free graphs
• Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
• On 2-factors in claw-free graphs
• On a closure concept in claw-free graphs
• Even subgraphs of bridgeless graphs and 2-factors of line graphs
• On the number of components in 2-factors of claw-free graphs
• 2-factors with bounded number of components in claw-free graphs
• On factors of 4-connected claw-free graphs
• Claw-free graphs and 2-factors that separate independent vertices
• Hamiltonian results inK1,3-free graphs
• Spanning even subgraphs of 3‐edge‐connected graphs
• Regular factors in K_1,3‐free graphs
• Regular factors in K_1,n free graphs
• Closure, 2-factors, and cycle coverings in claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Path factors in claw-free graphs

This page was built for publication: 2-factors in claw-free graphs with lower bounds cycle lengths