On Hamiltonicity of 2-connected claw-free graphs

DOI10.1007/s11766-012-2835-6zbMath1265.05322OpenAlexW2045070200MaRDI QIDQ1931154

Runli Tian, Limning Xiong

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

zbMATH Keywords

Hamiltonian cyclesclaw-free graphclosurehourglass propertysingle \(k\)-cycle property

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

On Hamiltonicity of 3-connected claw-free graphs

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 ₁₁ 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

This page was built for publication: On Hamiltonicity of 2-connected claw-free graphs