On Hamiltonicity of 2-connected claw-free graphs
From MaRDI portal
Publication:1931154
DOI10.1007/s11766-012-2835-6zbMath1265.05322MaRDI QIDQ1931154
Publication date: 24 January 2013
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-012-2835-6
Related Items
Cites Work
- On Hamiltonicity of 3-connected claw-free graphs
- Graph whose edges are in small cycles
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- On a closure concept in claw-free graphs
- Hamiltonian iterated line graphs
- On factors of 4-connected claw-free graphs
- E 11 and M theory
- Hamiltonian results inK1,3-free graphs
- HamiltonianN2-locally connected claw-free graphs
- Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs