Enumerating Hamiltonian cycles
zbMATH Open1298.05164MaRDI QIDQ463046FDOQ463046
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
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
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)
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- Title not available (Why is that?)
- On the number of Latin squares
- The Complexity of Enumeration and Reliability Problems
- Motzkin numbers
- Counting Hamiltonian cycles in bipartite graphs
- Enumerating perfect matchings in \(n\)-cubes
- 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
- Bandwidth and pathwidth of three-dimensional grids
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
Cited In (23)
- Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
- 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
- Title not available (Why is that?)
- Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs
- Enumerating simple paths from connected induced subgraphs
- 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
- Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
- Enumeration of Hamiltonian circuits in rectangular grids
- Title not available (Why is that?)
- 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
- Connecting the dots: maximal polygons on a square grid
- A matrix method for counting Hamiltonian cycles on grid graphs
- 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
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)