Enumeration of Tours in Hamiltonian Rectangular Lattice Graphs
From MaRDI portal
Publication:3904630
DOI10.2307/2689376zbMath0456.05035OpenAlexW4256572805MaRDI QIDQ3904630
Publication date: 1981
Full work available at URL: https://doi.org/10.2307/2689376
Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45) Polyominoes (05B50)
Related Items (3)
The number of Hamiltonian paths in a rectangular grid ⋮ A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole ⋮ Hamiltonian paths in \(L\)-shaped grid graphs
This page was built for publication: Enumeration of Tours in Hamiltonian Rectangular Lattice Graphs