Enumerating Hamiltonian cycles
type: Item
instance of: scholarly article
title: Enumerating Hamiltonian cycles
zbMATH Open document ID: 1298.05164
author: Ville H. Pettersson
published in: The Electronic Journal of Combinatorics
publication date: 2014-10-23T00:00:00Z
full work available at URL: v21i4p7
review text: 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.
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6360682
zbMATH Keywords: Hamiltonian cycles
zbMATH Keywords: enumeration
zbMATH Keywords: dynamic programming
describes a project that uses: OEIS
MaRDI profile type: Publication
cites work: Motzkin numbers
cites work: Lower bounds on the pathwidth of some grid-like graphs
cites work: Q4198056
cites work: On the bandwidth of triangulated triangles
cites work: Counting Hamiltonian cycles in bipartite graphs
cites work: Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
cites work: Q2957449
cites work: Q4209250
cites work: On the number of Latin squares
cites work: Q4821946
cites work: Enumerating perfect matchings in \(n\)-cubes
cites work: Bandwidth and pathwidth of three-dimensional grids
cites work: Counting peaks and valleys in \(k\)-colored Motzkin paths
cites work: The On-Line Encyclopedia of Integer Sequences
cites work: Q4892327
cites work: The Complexity of Enumeration and Reliability Problems
description: scientific article; zbMATH DE number 6360682