Bent Hamilton cycles in \(d\)-dimensional grid graphs

zbMath1012.05105MaRDI QIDQ1856346

Joe Sawada, Frank Ruskey

Publication date: 13 May 2003

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/122635

zbMATH Keywords

grid graph\(d\)-dimensionalbent Hamilton

Mathematics Subject Classification ID

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

Related Items (7)

\(c_2\) invariants of recursive families of graphs ⋮ Fibbinary zippers in a monoid of toroidal hamiltonian cycles that generate Hilbert-style square-filling curves ⋮ 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids ⋮ Embedding a family of disjoint multi-dimensional meshes into a crossed cube ⋮ \([r,s,t\)-colorings of graph products] ⋮ Gray codes for non-crossing partitions and dissections of a convex polygon ⋮ Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs

This page was built for publication: Bent Hamilton cycles in \(d\)-dimensional grid graphs