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
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