Bend complexity and Hamiltonian cycles in grid graphs
From MaRDI portal
Publication:2412428
DOI10.1007/978-3-319-62389-4_37zbMath1434.05086MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
05C45: Eulerian and Hamiltonian graphs
Related Items
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, 1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids