Hamiltonian Properties of Grid Graphs

DOI10.1137/0405046MaRDI QIDQ4030195zbMATH OpenOpenAlexFDO

Authors Christina Maria Zamfirescu, Tudor 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

line graphHamiltonian graphgrid graphHamiltonian line graphsinfinite Hamiltonian path

Mathematics Subject Classification ID

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

Cited in

(19)

• Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
• Some new characterizations of Hamiltonian cycles in triangular grid graphs
• A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole
• Bend complexity and Hamiltonian cycles in grid graphs
• The Hamiltonian connectivity of rectangular supergrid graphs
• Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time
• The number of Hamiltonian paths in a rectangular grid
• Longest (s, t)-paths in L-shaped grid graphs
• A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes
• Hamiltonian paths in L-shaped grid graphs
• Hamiltonian cycles in linear-convex supergrid graphs
• Hamiltonian paths in some classes of grid graphs
• The Hamilton circuit problem on grids
• The Hamiltonian properties of supergrid graphs
• The Hamiltonian path graph is connected for simple s,t paths in rectangular grid graphs
• Hamiltonian properties of triangular grid graphs
• Hamiltonicity of rectangular grid graphs (meshes) with an L-shaped hole
• Hamiltonian properties of honeycomb meshes
• 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids

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

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