The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs
From MaRDI portal
Publication:6113877
DOI10.1007/978-3-031-22105-7_41arXiv2205.08025MaRDI QIDQ6113877
S. H. Whitesides, Venkatesh Srinivasan, Rahnuma Islam Nishat
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.08025
68Rxx: Discrete mathematics in relation to computer science
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of reconfiguration problems
- The number of Hamiltonian paths in a rectangular grid
- 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
- Introduction to reconfiguration
- Complexity of Hamiltonian cycle reconfiguration
- Milling a Graph with Turn Costs: A Parameterized Complexity Perspective
- Hamilton Paths in Grid Graphs
- Optimal Covering Tours with Turn Costs
- Hamiltonian paths in \(L\)-shaped grid graphs