Computing Sharp 2-Factors in Claw-Free Graphs
DOI10.1007/978-3-540-85238-4_15zbMATH Open1173.05348OpenAlexW2989468009MaRDI QIDQ3599127FDOQ3599127
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Matching theory
- Claw-free graphs---a survey
- On a closure concept in claw-free graphs
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamiltonian results inK1,3-free graphs
- Graph factors and factorization: 1985--2003: a survey
- On the number of components in 2-factors of claw-free graphs
- Regular factors in K1,3‐free graphs
- Regular factors in K1,n free graphs
- Title not available (Why is that?)
- Closure, 2-factors, and cycle coverings in claw-free graphs
- On traceability and 2-factors in claw-free graphs
- On 2-factors in claw-free graphs
- Even subgraphs of bridgeless graphs and 2-factors of line graphs
- Two-factors with few cycles in claw-free graphs
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
- Closure concepts for claw-free graphs
Cited In (3)
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)
