Bend complexity and Hamiltonian cycles in grid graphs

DOI10.1007/978-3-319-62389-4_37zbMath1434.05086OpenAlexW2728231354MaRDI QIDQ2412428

Rahnuma Islam Nishat, S. H. Whitesides

Publication date: 23 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_37

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids ⋮ Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs ⋮ 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids ⋮ Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs

This page was built for publication: Bend complexity and Hamiltonian cycles in grid graphs