Hamiltonicity in 3-connected claw-free graphs
From MaRDI portal
Publication:2496201
DOI10.1016/j.jctb.2005.10.003zbMath1095.05024OpenAlexW1977364731MaRDI QIDQ2496201
Hong-Jian Lai, Mingquan Zhan, Yehong Shao
Publication date: 12 July 2006
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2005.10.003
Related Items
Circumferences of 3-connected claw-free graphs ⋮ Circumferences of 3-connected claw-free graphs. II. ⋮ Hamiltonian line graphs with local degree conditions ⋮ Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs ⋮ Degree and neighborhood conditions for Hamiltonicity of claw-free graphs ⋮ Hamiltonicity of 6-connected line graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Hamiltonian claw-free graphs involving minimum degrees ⋮ Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs ⋮ On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs ⋮ Circumferences and minimum degrees in 3-connected claw-free graphs ⋮ Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
- On a closure concept in claw-free graphs
- Eulerian subgraphs containing given vertices and hamiltonian line graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Hamiltonicity and minimum degree in 3-connected claw-free graphs
- Hamiltonian results inK1,3-free graphs
- A reduction method to find spanning Eulerian subgraphs
- Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Clique covering and degree conditions for Hamiltonicity in claw-free graphs