Computing sharp 2-factors in claw-free graphs

DOI10.1016/J.JDA.2009.07.001MaRDI QIDQ988693zbMATH OpenOpenAlexFDO

Authors Daniël Paulusma, Hajo Broersma

Publication date 18 August 2010

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2009.07.001

zbMATH Keywords

2-factorclaw-free graphnumber of componentspolynomial algorithm

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Computing Sharp 2-Factors in Claw-Free Graphs
• On 2-factors in claw-free graphs
• On 2-factors in claw-free graphs whose edges are in small cycles
• Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
• On components of 2-factors in claw-free graphs

Cites work

• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• Claw-free graphs---a survey
• Closure concepts for claw-free graphs
• Closure, 2-factors, and cycle coverings in claw-free graphs
• Even subgraphs of bridgeless graphs and 2-factors of line graphs
• Graph factors and factorization: 1985--2003: a survey
• Hamiltonian results inK1,3-free graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1289749 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Matching theory
• On 2-factors in claw-free graphs
• On a closure concept in claw-free graphs
• On the number of components in 2-factors of claw-free graphs
• On traceability and 2-factors in claw-free graphs
• Regular factors in K_1,3‐free graphs
• Regular factors in K_1,n free graphs
• Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
• Two-factors with few cycles in claw-free graphs

Cited in

(5)

• Exact algorithms for finding longest cycles in claw-free graphs
• On components of 2-factors in claw-free graphs
• Computing Sharp 2-Factors in Claw-Free Graphs
• How many conjectures can you stand? A survey
• Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs

This page was built for publication: Computing sharp 2-factors in claw-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q988693)