Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples

DOI10.5614/ejgta.2019.7.1.5zbMath1467.05146arXiv1702.02623OpenAlexW2963870440MaRDI QIDQ5009933

Andrew Johnson, Michael Haythorpe

Publication date: 23 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/1702.02623

zbMATH Keywords

triplesHamiltonian cycleschange ringingErinStedman

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

On hamiltonicity of 1-tough triangle-free graphs ⋮ A construction for directed in-out subgraphs of optimal size ⋮ Chinese remainder encoding for Hamiltonian cycles

Uses Software

• LKH
• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• A Simple Proof of Rankin's Campanological Theorem
• A Linear-size Conversion of HCP to 3HCP
• Ringing the Cosets
• Ringing the cosets. II
• Some Examples of Difficult Traveling Salesman Problems
• A construction for directed in-out subgraphs of optimal size
• Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles
• FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem
• Algorithms and Data Structures

This page was built for publication: Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples