Enumerating Hamiltonian Cycles

  • Ville H. Pettersson
DOI: https://doi.org/10.37236/4510
Keywords: Hamiltonian cycles, Enumeration, Dynamic Programming

Abstract

A dynamic programming method for enumerating hamiltonian cycles in arbitrary graphs is presented. The method is applied to grid graphs, king's graphs, triangular grids, and three-dimensional grid graphs, and results are obtained for larger cases than previously published. The approach can easily be modified to enumerate hamiltonian paths and other similar structures.

Published
2014-10-09
Issue
Volume 21, Issue 4 (2014)
Article Number
P4.7