Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs
type: Item
instance of: scholarly article
title: Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs
DOI: 10.1007/978-3-030-79987-8_35
author: Rahnuma Islam Nishat
author: Venkatesh Srinivasan
author: Sue Whitesides
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Rxx
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7495044
MaRDI profile type: Publication
full work available at URL: 978-3-030-79987-8 35
OpenAlex ID: W3175978794
cites work: Optimal covering tours with turn costs
cites work: The number of Hamiltonian paths in a rectangular grid
cites work: Q3772257
cites work: Milling a Graph with Turn Costs: A Parameterized Complexity Perspective
cites work: Hamilton Paths in Grid Graphs
cites work: On the complexity of reconfiguration problems
cites work: Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
cites work: Hamiltonian paths in \(L\)-shaped grid graphs
cites work: Bend complexity and Hamiltonian cycles in grid graphs
cites work: Reconfiguring Hamiltonian cycles in L-shaped grid graphs
cites work: Introduction to reconfiguration
cites work: Q5408279
cites work: Enumerating Hamiltonian cycles
cites work: Bent Hamilton cycles in \(d\)-dimensional grid graphs
cites work: Complexity of Hamiltonian cycle reconfiguration
cites work: Q4792778
Recommended article: Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs
Recommended article: 1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids
Recommended article: 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
Recommended article: Hamiltonian paths in some classes of grid graphs
Recommended article: Q3772257
Recommended article: Reconfiguring Hamiltonian cycles in L-shaped grid graphs
Recommended article: Hamiltonian paths in \(L\)-shaped grid graphs
Recommended article: The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs
Recommended article: A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole
Recommended article: Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time
description: scientific article; zbMATH DE number 7495044