Hamiltonian Properties of Grid Graphs

DOI10.1137/0405046zbMath0770.05073OpenAlexW1989631462MaRDI QIDQ4030195

Christina Maria Zamfirescu, Tudor I. Zamfirescu

Publication date: 1 April 1993

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0405046

zbMATH Keywords

Hamiltonian graphline graphgrid graphHamiltonian line graphsinfinite Hamiltonian path

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (12)

The number of Hamiltonian paths in a rectangular grid ⋮ Hamiltonian cycles in linear-convex supergrid graphs ⋮ Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths ⋮ A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole ⋮ Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time ⋮ 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids ⋮ A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes ⋮ Hamiltonian paths in some classes of grid graphs ⋮ Longest (s, t)-paths in L-shaped grid graphs ⋮ The Hamiltonian properties of supergrid graphs ⋮ The Hamiltonian connectivity of rectangular supergrid graphs ⋮ Hamiltonian paths in \(L\)-shaped grid graphs

This page was built for publication: Hamiltonian Properties of Grid Graphs