Computing sharp 2-factors in claw-free graphs

DOI10.1016/j.jda.2009.07.001zbMath1231.05210OpenAlexW3032434623MaRDI QIDQ988693

Daniël Paulusma, Hajo J. 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 graphpolynomial algorithmnumber of components

Mathematics Subject Classification ID

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

Related Items (2)

Exact algorithms for finding longest cycles in claw-free graphs ⋮ How many conjectures can you stand? A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
• Graph factors and factorization: 1985--2003: a survey
• Matching theory
• On 2-factors in claw-free graphs
• Claw-free graphs---a survey
• On a closure concept in claw-free graphs
• Closure concepts for claw-free graphs
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• 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
• 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
• Two-factors with few cycles in claw-free graphs

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