Hamiltonicity in 2-connected graphs with claws
From MaRDI portal
Publication:1382829
DOI10.1016/S0012-365X(97)00056-3zbMath0893.05009OpenAlexW2059242370MaRDI QIDQ1382829
Publication date: 11 August 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00056-3
Related Items (5)
Claw-free graphs---a survey ⋮ Hamiltonicity of 2-connected claw-center independent graphs ⋮ \(D_ \lambda\)-cycles in 3-cyclable graphs ⋮ Hamiltonicity in Partly claw-free graphs ⋮ Neighborhood conditions for graphs with induced claws
Cites Work
- Unnamed Item
- Unnamed Item
- On Hamiltonian claw-free graphs
- Dominating cycles in regular 3-connected graphs
- Hamiltonian cycles in 3-connected claw-free graphs
- Hamiltonian results inK1,3-free graphs
- Longest paths and cycles in K1,3-free graphs
- Hamilton cycles in claw-free graphs
- Hamiltonian cycles in 3‐connected claw‐free graphs
- Toughness and hamiltonicity in almost claw-free graphs
- Some Theorems on Abstract Graphs
This page was built for publication: Hamiltonicity in 2-connected graphs with claws