Hamiltonicity of 4-connected graphs

DOI10.1007/s10114-010-7514-zzbMath1190.05083OpenAlexW1972173462MaRDI QIDQ966553

Zhi Xia Xu, Feng Tian, Hao Li

Publication date: 23 April 2010

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-010-7514-z

zbMATH Keywords

Hamiltonian\(k\)-connectedinsertible vertexcrossing diagonals

Mathematics Subject Classification ID

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

Related Items (2)

Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Vertex-antimagic labelings of regular graphs

Cites Work

• Unnamed Item
• A generalization of a result of Häggkvist and Nicoghossian
• Cycles through subsets with large degree sums
• Cycles through prescribed vertices with large degree sum
• A note on Hamiltonian circuits
• Two sufficient conditions for dominating cycles
• Note on Hamilton Circuits
• An improvement of fraisse's sufficient condition for hamiltonian graphs
• Cyclability of 3-connected graphs
• Cycles through particular subgraphs of claw‐free graphs
• Sequences, claws and cyclability of graphs

This page was built for publication: Hamiltonicity of 4-connected graphs