Creating recreational Hamiltonian cycle problems
2004 ◽
Vol 88
(512)
◽
pp. 215-218
◽
Keyword(s):
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.
Keyword(s):
2007 ◽
Vol 08
(03)
◽
pp. 253-284
◽
2004 ◽
Vol 14
(05n06)
◽
pp. 677-702
◽
Keyword(s):
1975 ◽
Vol 12
(1)
◽
pp. 27-30
◽
Keyword(s):
2012 ◽
Vol 21
(14)
◽
pp. 1250132
◽
Keyword(s):
Keyword(s):