Counting Hamiltonian cycles in bipartite graphs
From MaRDI portal
Publication:2871195
DOI10.1090/S0025-5718-2013-02741-XzbMath1280.05075MaRDI QIDQ2871195
Patric R. J. Östergård, Harri Haanpää
Publication date: 22 January 2014
Published in: Mathematics of Computation (Search for Journal in Brave)
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (4)
On locally balanced gray codes ⋮ Enumerating perfect matchings in \(n\)-cubes ⋮ Enumerating Hamiltonian cycles ⋮ Refining invariants for computing autotopism groups of partial Latin rectangles
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classification algorithms for codes and designs
- A survey of the theory of hypercube graphs
- An extension of the multi-path algorithm for finding Hamilton cycles
- Generating Hamiltonian circuits without backtracking from errors
- The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams
- Perfect matchings extend to Hamilton cycles in hypercubes
- The number of Latin squares of order 11
- Statistical estimates of the<tex>n</tex>-bit Gray codes by restricted random generation of permutations of 1 to<tex>2^n</tex>
- The Complexity of Enumeration and Reliability Problems
- A Search Procedure for Hamilton Paths and Circuits
- Isomorph-Free Exhaustive Generation
- Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph
- Graphs, Algorithms, and Optimization
- Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms
This page was built for publication: Counting Hamiltonian cycles in bipartite graphs
