Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs

DOI10.1007/978-3-030-79987-8_35OpenAlexW3175978794MaRDI QIDQ2115888

Rahnuma Islam Nishat, Venkatesh Srinivasan, S. H. 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)

Related Items (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerating Hamiltonian cycles
• On the complexity of reconfiguration problems
• The number of Hamiltonian paths in a rectangular grid
• Bent Hamilton cycles in \(d\)-dimensional grid graphs
• Reconfiguring Hamiltonian cycles in L-shaped grid graphs
• Introduction to reconfiguration
• Bend complexity and Hamiltonian cycles in grid graphs
• Complexity of Hamiltonian cycle reconfiguration
• Milling a Graph with Turn Costs: A Parameterized Complexity Perspective
• Hamilton Paths in Grid Graphs
• Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
• Hamiltonian paths in \(L\)-shaped grid graphs

This page was built for publication: Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs