Enumerating Hamiltonian cycles

zbMath1298.05164MaRDI QIDQ463046

Ville H. Pettersson

Publication date: 23 October 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p7

zbMATH Keywords

dynamic programmingenumerationHamiltonian cycles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs ⋮ 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids ⋮ The structure of the 2-factor transfer digraph common for rectangular, thick cylinder and Moebius strip grid graphs ⋮ Connecting the Dots: Maximal Polygons on a Square Grid ⋮ Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs

Uses Software

• OEIS

Cites Work

• Enumerating perfect matchings in \(n\)-cubes
• Bandwidth and pathwidth of three-dimensional grids
• Counting peaks and valleys in \(k\)-colored Motzkin paths
• On the bandwidth of triangulated triangles
• Lower bounds on the pathwidth of some grid-like graphs
• On the number of Latin squares
• Counting Hamiltonian cycles in bipartite graphs
• The Complexity of Enumeration and Reliability Problems
• Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
• Motzkin numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumerating Hamiltonian cycles