Circumferences of 2-factors in claw-free graphs
From MaRDI portal
Publication:383757
DOI10.1016/J.DISC.2012.08.005zbMATH Open1277.05098OpenAlexW1971355994MaRDI QIDQ383757FDOQ383757
Authors: Roman Čada, Shuya Chiba 
Publication date: 6 December 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.08.005
Recommendations
Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Cites Work
- Circumferences and minimum degrees in 3-connected claw-free graphs
- On a closure concept in claw-free graphs
- Longest paths and cycles in K1,3-free graphs
- Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
- Title not available (Why is that?)
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Hamiltonian results inK1,3-free graphs
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- Hamilton cycles in 5-connected line graphs
- Longest cycles in regular 2-connected claw-free graphs
- On the number of components in 2-factors of claw-free graphs
- Claw-free graphs and 2-factors that separate independent vertices
- Title not available (Why is that?)
- Regular factors in K1,3‐free graphs
- Regular factors in K1,n free graphs
- Closure, 2-factors, and cycle coverings in claw-free graphs
- Title not available (Why is that?)
- 2-factors and independent sets on claw-free graphs
Cited In (5)
This page was built for publication: Circumferences of 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 Q383757)
