Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs

DOI10.1007/S00373-009-0855-7zbMath1210.05064OpenAlexW2117026625MaRDI QIDQ844222

Kiyoshi Yoshimoto, Daniël Paulusma, Hajo J. Broersma

Publication date: 18 January 2010

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

Full work available at URL: http://dro.dur.ac.uk/6280/1/14156.pdf

zbMATH Keywords

2-factorclaw-free graphminimum degreeedge-degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

Claw-free graphs and 2-factors that separate independent vertices ⋮ 2-factors and independent sets on claw-free graphs ⋮ How many conjectures can you stand? A survey ⋮ 2-factors in claw-free graphs with lower bounds cycle lengths ⋮ Unnamed Item ⋮ Computing Sharp 2-Factors in Claw-Free Graphs ⋮ Computing sharp 2-factors in claw-free graphs ⋮ 2-factors with bounded number of components in claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph factors and factorization: 1985--2003: a survey
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
• On 2-factors in claw-free graphs
• Claw-free graphs---a survey
• 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
• 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 traceability and 2-factors in claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Two-factors with few cycles in claw-free graphs

This page was built for publication: Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs