Hamilton cycles in regular 3-connected graphs

DOI10.1016/0012-365X(92)90712-OzbMath0774.05063OpenAlexW1963734119MaRDI QIDQ1208363

Yung-ching Chu, 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

regular graphHamiltonicityHamilton cyclesHamiltonian graphs

Mathematics Subject Classification ID

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

Related Items (5)

Cycle partitions of regular graphs ⋮ Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs ⋮ The robust component structure of dense regular graphs and applications ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Cycles through vertices of large maximum degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dominating cycles in regular 3-connected graphs
• Hamiltonian cycles in regular graphs of moderate degree
• Hamilton cycles in regular 2-connected graphs
• Hamiltonian Cycles in Regular Graphs
• The binding number of a graph and its Anderson number

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