Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-14T07:22:16.918Z Has data issue: false hasContentIssue false
  • English
  • Français

Creating recreational Hamiltonian cycle problems

Published online by Cambridge University Press:  01 August 2016

Mark A. M. Lynch
Mark A. M. Lynch*
Affiliation:
Glasgow Caledonian University, 70 Cowcaddens Road, Glasgow G4 0BA
Get access Rights & Permissions [Opens in a new window]

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
The Mathematical Gazette , Volume 88 , Issue 512 , July 2004 , pp. 215 - 218
Copyright
Copyright © The Mathematical Association 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)