Reconfiguring simple s, t Hamiltonian paths in rectangular grid graphs

DOI10.1007/978-3-030-79987-8_35MaRDI QIDQ2115888zbMATH OpenOpenAlexFDO

Authors Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-79987-8_35

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs
• 1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids
• 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
• Hamiltonian paths in some classes of grid graphs
• scientific article; zbMATH DE number 4031743
• Reconfiguring Hamiltonian cycles in L-shaped grid graphs
• Hamiltonian paths in \(L\)-shaped grid graphs
• The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs
• A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole
• Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time

Cites work

• scientific article; zbMATH DE number 4031743 (Why is no real title available?)
• scientific article; zbMATH DE number 1870068 (Why is no real title available?)
• scientific article; zbMATH DE number 6282146 (Why is no real title available?)
• Bend complexity and Hamiltonian cycles in grid graphs
• Bent Hamilton cycles in \(d\)-dimensional grid graphs
• Complexity of Hamiltonian cycle reconfiguration
• Enumerating Hamiltonian cycles
• Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
• Hamilton Paths in Grid Graphs
• Hamiltonian paths in \(L\)-shaped grid graphs
• Introduction to reconfiguration
• Milling a graph with turn costs: a parameterized complexity perspective
• On the complexity of reconfiguration problems
• Optimal covering tours with turn costs
• Reconfiguring Hamiltonian cycles in L-shaped grid graphs
• The number of Hamiltonian paths in a rectangular grid

Cited in

(7)

• 1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids
• Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs
• The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs
• The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs
• Hamiltonian (s, t)-paths in solid supergrid 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: Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs

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