Hamiltonian Cycles in Regular Graphs

DOI10.1016/S0167-5060(08)70496-5MaRDI QIDQ4154583zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Arthur M. Hobbs

Publication date 1978

Published in Advances in Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-5060(08)70496-5

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited in

(10)

• Long path connectivity of regular graphs
• Cycle partitions of regular graphs
• On regular 2-path Hamiltonian graphs
• Every even-regular Hamiltonian graph is vertex-magic
• Longest cycles in regular graphs
• Dominating cycles in regular 3-connected graphs
• Hamilton cycles in regular 3-connected graphs
• Hamilton cycles in regular 2-connected graphs
• Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey

This page was built for publication: Hamiltonian Cycles in Regular Graphs

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