Article contents
Creating recreational Hamiltonian cycle problems
Published online by Cambridge University Press: 01 August 2016
Extract
In this paper graphs that contain unique Hamiltonian cycles are introduced. The graphs are of arbitrary size and dense in the sense that their average vertex degree is greater than half the number of vertices that make up the graph. The graphs can be used to generate challenging puzzles. The problem is particularly challenging when the graph is large and the ‘method’ of solution is unknown to the solver.
- Type
- Articles
- Information
- Copyright
- Copyright © The Mathematical Association 2004
- 1
- Cited by