Enumeration of Hamiltonian cycles in a squared rectangle
From MaRDI portal
Publication:1202737
DOI10.1016/0195-6698(92)90005-KzbMath0762.05057OpenAlexW1969352769MaRDI QIDQ1202737
Publication date: 3 February 1993
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0195-6698(92)90005-k
Enumeration in graph theory (05C30) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Polyominoes (05B50)
Related Items (5)
Thin Hamiltonian cycles on Archimedean graphs ⋮ The number of Hamiltonian paths in a rectangular grid ⋮ Some new characterizations of Hamiltonian cycles in triangular grid graphs ⋮ A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs ⋮ Enumeration of Hamiltonian cycles on a thick grid cylinder - part I: Non-contractible Hamiltonian cycles
Cites Work
This page was built for publication: Enumeration of Hamiltonian cycles in a squared rectangle
