Enumeration of Tours in Hamiltonian Rectangular Lattice Graphs

DOI10.2307/2689376MaRDI QIDQ3904630zbMATH OpenOpenAlexFDO

Authors B. R. Myers

Publication date 1981

Full work available at URL https://doi.org/10.2307/2689376

zbMATH Keywords

Hamiltonian cyclesrectangular lattice graphtourstree-like polyomino

Mathematics Subject Classification ID

Polyominoes (05B50) Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75)

Cited in

(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

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