Computing Sharp 2-Factors in Claw-Free Graphs

DOI10.1007/978-3-540-85238-4_15MaRDI QIDQ3599127zbMATH OpenOpenAlexFDO

Authors Daniël Paulusma, Hajo Broersma

Publication date 3 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://research.utwente.nl/en/publications/computing-sharp-2factors-in-clawfree-graphs(564f547b-0cd0-43e4-8221-abb50eceb1bd).html

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

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
• On components of 2-factors in claw-free graphs
• Sharp upper bounds on the minimum number of 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 1518742 (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

(3)

• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
• Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
• Computing sharp 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 Q3599127)