Circumferences of 2-factors in claw-free graphs
From MaRDI portal
Publication:383757
DOI10.1016/j.disc.2012.08.005zbMath1277.05098MaRDI QIDQ383757
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
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C45: Eulerian and Hamiltonian graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamilton cycles in 5-connected line graphs
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- 2-factors and independent sets on claw-free graphs
- Circumferences and minimum degrees in 3-connected claw-free graphs
- Longest cycles in regular 2-connected claw-free graphs
- On a closure concept in 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
- Hamiltonian results inK1,3-free graphs
- Longest paths and cycles in K1,3-free graphs
- Regular factors in K1,3‐free graphs
- Regular factors in K1,n free graphs
- Closure, 2-factors, and cycle coverings in claw-free graphs
- Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs