The Hamiltonian path graph is connected for simple $s,t$ paths in rectangular grid graphs

Cites Work

Unnamed Item
Unnamed Item
Enumerating Hamiltonian cycles
On the parameterized complexity of reconfiguration problems
On the complexity of reconfiguration problems
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
Hamiltonian properties of triangular grid graphs
Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
A matrix method for counting Hamiltonian cycles on grid graphs
The number of Hamiltonian paths in a rectangular grid
Hamiltonian cycles in T-graphs
An efficient algorithm for constructing Hamiltonian paths in meshes
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
Introduction to reconfiguration
Bend complexity and Hamiltonian cycles in grid graphs
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
Complexity of Hamiltonian cycle reconfiguration
Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective
Hamiltonian Properties of Grid Graphs
The Hamilton circuit problem on grids
Algebraic techniques for enumerating self-avoiding walks on the square lattice
Hamilton Paths in Grid Graphs
Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
Optimal Covering Tours with Turn Costs
Self-avoiding walks crossing a square
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Hamiltonian paths in $L$-shaped 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: The Hamiltonian path graph is connected for simple $s,t$ paths in rectangular grid graphs

The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs