Hamilton cycles in regular 3-connected graphs

DOI10.1016/0012-365X(92)90712-OMaRDI QIDQ1208363zbMATH OpenOpenAlexFDO

Authors Yongjin Zhu, Hao Li

Publication date 16 May 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(92)90712-o

zbMATH Keywords

Hamilton cyclesHamiltonian graphsHamiltonicityregular graph

Mathematics Subject Classification ID

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

Review text

Let \(G\) be a 3-connected \(k\)-regular graph on \(n\) vertices. It is known that \(G\) is Hamiltonian if \(k\geq 14\) and \(n\leq 3k+4\), and it has been conjectured that even \(k\geq 4\) and \(n\geq 4k\) imply Hamiltonicity. In the present paper it is shown that \(G\) is Hamiltonian if \(k\geq 63\) and \(n\leq{22\over 7}k\).

Recommendations

• scientific article; zbMATH DE number 3966120
• Hamiltonian cycles in regular graphs of moderate degree
• Hamiltonicity in connected regular graphs
• Dominating cycles in regular 3-connected graphs
• scientific article; zbMATH DE number 3929043

Cites work

• Dominating cycles in regular 3-connected graphs
• Graph theory
• Hamilton cycles in regular 2-connected graphs
• Hamiltonian Cycles in Regular Graphs
• Hamiltonian cycles in regular graphs of moderate degree
• scientific article; zbMATH DE number 193589 (Why is no real title available?)
• scientific article; zbMATH DE number 3999970 (Why is no real title available?)
• The binding number of a graph and its Anderson number

Cited in

(28)

• Hamiltonian cycles in regular graphs
• Dominating cycles in regular 3-connected graphs
• Hamiltonian cycles in regular graphs of moderate degree
• Hamilton cycles in 2-connected regular bipartite graphs
• On Hamiltonicity of regular graphs with bounded second neighborhoods
• Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
• The robust component structure of dense regular graphs and applications
• scientific article; zbMATH DE number 3889569 (Why is no real title available?)
• Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
• scientific article; zbMATH DE number 3863239 (Why is no real title available?)
• scientific article; zbMATH DE number 3929043 (Why is no real title available?)
• scientific article; zbMATH DE number 3966120 (Why is no real title available?)
• Circumference of a regular graph
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• scientific article; zbMATH DE number 4127257 (Why is no real title available?)
• Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
• Cycles through vertices of large maximum degree
• On the minimum number of Hamiltonian cycles in regular graphs
• scientific article; zbMATH DE number 3999970 (Why is no real title available?)
• scientific article; zbMATH DE number 908781 (Why is no real title available?)
• \(4\)-regular \(4\)-connected Hamiltonian graphs with a bounded number of Hamiltonian cycles
• Regular graphs with few longest cycles
• The robust component structure of dense regular graphs
• Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs
• Cycle partitions of regular graphs
• Hamilton cycles in almost-regular 2-connected graphs
• Edge bounds in nonhamiltonian k-connected graphs
• Edge-Hamiltonian property in regular 2-connected graphs

This page was built for publication: Hamilton cycles in regular 3-connected graphs

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