Enumerating Hamiltonian cycles
Summary: 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.
scientific article; zbMATH DE number 6360682