Hamiltonicity of 4-connected graphs

DOI10.1007/S10114-010-7514-ZMaRDI QIDQ966553zbMATH OpenOpenAlexFDO

Authors Hao Li, Feng Tian, Zhixia Xu

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

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

Recommendations

• Degree sums, connectivity and dominating cycles in graphs
• A degree sum condition concerning the connectivity and the independence number of a graph
• Publication:4940054
• A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity
• Hamiltonicity for K_{1, r}‐free graphs

Cites work

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

Cited in

(16)

• scientific article; zbMATH DE number 3877231 (Why is no real title available?)
• scientific article; zbMATH DE number 409961 (Why is no real title available?)
• Finding and enumerating Hamilton cycles in 4-regular graphs
• Hamiltonian paths and cycles in some 4-uniform hypergraphs
• Solution to an open problem on 4-ordered Hamiltonian graphs
• Parameterized algorithms in smooth 4-regular Hamiltonian graphs
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• On hamiltonian connectedness of \(K_{1,4}\)-free graphs
• scientific article; zbMATH DE number 866659 (Why is no real title available?)
• Four sufficient conditions for hamiltonian graphs
• scientific article; zbMATH DE number 5952195 (Why is no real title available?)
• 4-connected projective planar graphs are Hamiltonian
• Vertex-antimagic labelings of regular graphs
• Degree sums, connectivity and dominating cycles in graphs
• scientific article; zbMATH DE number 5257394 (Why is no real title available?)
• Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966553)