On Hamiltonicity of 3-connected claw-free graphs

DOI10.1007/S00373-013-1343-7zbMath1298.05192OpenAlexW2053536238MaRDI QIDQ742642

Runli Tian, Zhaohong Niu, Limning Xiong

Publication date: 19 September 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1343-7

zbMATH Keywords

claw-free graphHamiltonicitylocally disconnected vertexsingular \(k\)-cyclesingular edge

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

A note on singular edges and Hamiltonicity in claw-free graphs with locally disconnected vertices ⋮ On Hamiltonicity of 2-connected claw-free graphs

Cites Work

• Quadrangularly connected claw-free graphs
• Graph whose edges are in small cycles
• Forbidden subgraphs, stability and hamiltonicity
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• On a closure concept in claw-free graphs
• On Hamiltonicity of 2-connected claw-free graphs
• On factors of 4-connected claw-free graphs
• Hamiltonian results inK1,3-free graphs
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• HamiltonianN2-locally connected claw-free graphs
• Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs
• Hamiltonicity and forbidden subgraphs in 4‐connected graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Hamiltonian circuits in N₂‐locally connected K_1,3‐free graphs

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