Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs

DOI10.1016/j.jctb.2015.12.003zbMath1348.05118arXiv1402.4754OpenAlexW1913884843MaRDI QIDQ326810

Deryk Osthus, Daniela Kühn, Allan Lo, Katherine Staden

Publication date: 12 October 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.4754

zbMATH Keywords

connectivityregular graphsHamilton cyclesrobust expansion

Mathematics Subject Classification ID

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

Related Items (5)

Cycle partitions of regular graphs ⋮ On Hamiltonicity of regular graphs with bounded second neighborhoods ⋮ A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs ⋮ Hamilton cycles in sparse robustly expanding digraphs ⋮ Hamilton cycles in dense regular digraphs and oriented graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on Hamilton cycles in directed graphs
• Hamiltonian degree sequences in digraphs
• 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
• The robust component structure of dense regular graphs and applications
• A class of Hamiltonian regular graphs
• Hamiltonian Cycles in Regular Graphs

This page was built for publication: Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs