Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles

DOI10.5614/ejgta.2016.4.1.3zbMath1467.05145arXiv1902.10351OpenAlexW2337842652MaRDI QIDQ5006572

Michael Haythorpe

Publication date: 16 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

Hamiltonian cyclesgraph constructionbroken crown

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Lower bounds for the algebraic connectivity of graphs with specified subgraphs ⋮ Reducing the generalised Sudoku problem to the Hamiltonian cycle problem ⋮ Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples

Uses Software

• LKH
• Concorde

Cites Work

• Unnamed Item
• Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Graphs with exactly one hamiltonian circuit

This page was built for publication: Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles