Publication:3772257
From MaRDI portal
zbMath0634.05052MaRDI QIDQ3772257
No author found.
Publication date: 1986
68R10: Graph theory (including graph drawing) in computer science
05C45: Eulerian and Hamiltonian graphs
Related Items
1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids, The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs, Not being (super)thin or solid is hard: A study of grid Hamiltonicity, Watchman routes under limited visibility, The number of Hamiltonian paths in a rectangular grid, Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs, 1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids