Bend complexity and Hamiltonian cycles in grid graphs

DOI10.1007/978-3-319-62389-4_37MaRDI QIDQ2412428zbMATH OpenOpenAlexFDO

Authors Rahnuma Islam Nishat, Sue 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

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

Recommendations

• Bent Hamilton cycles in \(d\)-dimensional grid graphs
• Hamiltonian Properties of Grid Graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• scientific article; zbMATH DE number 5543678
• Hamiltonian paths in some classes of grid graphs
• Edge-intersection graphs of grid paths: the bend-number
• Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs
• scientific article; zbMATH DE number 6282146
• Edge-Intersection Graphs of k-Bend Paths in Grids

Cited in

(8)

• Bent Hamilton cycles in \(d\)-dimensional grid graphs
• Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs
• 1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids
• Reconfiguring Hamiltonian cycles in L-shaped grid graphs
• scientific article; zbMATH DE number 2109328 (Why is no real title available?)
• Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2412428)