Enumerating Hamiltonian cycles

MaRDI QIDQ463046zbMATH OpenFDO

Authors 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

dynamic programmingenumerationHamiltonian cycles

Mathematics Subject Classification ID

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

Recommendations

• Enumeration of Hamiltonian circuits in digraphs
• On the construction and enumeration of Hamiltonian graphs
• Enumeration of Hamiltonian circuits in rectangular grids
• A matrix method for counting Hamiltonian cycles on grid graphs
• Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1206598 (Why is no real title available?)
• scientific article; zbMATH DE number 2109328 (Why is no real title available?)
• scientific article; zbMATH DE number 927054 (Why is no real title available?)
• Bandwidth and pathwidth of three-dimensional grids
• Counting Hamiltonian cycles in bipartite graphs
• Counting peaks and valleys in \(k\)-colored Motzkin paths
• Enumerating perfect matchings in n-cubes
• Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
• Lower bounds on the pathwidth of some grid-like graphs
• Motzkin numbers
• On the bandwidth of triangulated triangles
• On the number of Latin squares
• The Complexity of Enumeration and Reliability Problems
• The On-Line Encyclopedia of Integer Sequences
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.

Cited in

(23)

• Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
• scientific article; zbMATH DE number 4063127 (Why is no real title available?)
• Hamiltonian cycle enumeration via fermion-zeon convolution
• Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs
• Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs
• Hamiltonian chains in orgraphs
• scientific article; zbMATH DE number 819115 (Why is no real title available?)
• Enumerating simple paths from connected induced subgraphs
• Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs
• The structure of the 2-factor transfer digraph common for rectangular, thick cylinder and Moebius strip grid graphs
• Counting Hamiltonian cycles in bipartite graphs
• On the construction and enumeration of Hamiltonian graphs
• Enumeration of Hamiltonian circuits in rectangular grids
• Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
• scientific article; zbMATH DE number 6282146 (Why is no real title available?)
• Hamilton cycles and degree sequences
• Enumeration of Hamiltonian circuits in digraphs
• The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs
• Enumeration of Hamiltonian cycles in a squared rectangle
• A matrix method for counting Hamiltonian cycles on grid graphs
• Connecting the dots: maximal polygons on a square grid
• scientific article; zbMATH DE number 22818 (Why is no real title available?)
• 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Enumerating Hamiltonian cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463046)