DeepAI AI Chat
Log In Sign Up

The Hamiltonian Path Graph is Connected for Simple s,t Paths in Rectangular Grid Graphs

by   Rahnuma Islam Nishat, et al.
University of Victoria
Ryerson University

A simple s,t path P in a rectangular grid graph 𝔾 is a Hamiltonian path from the top-left corner s to the bottom-right corner t such that each internal subpath of P with both endpoints a and b on the boundary of 𝔾 has the minimum number of bends needed to travel from a to b (i.e., 0, 1, or 2 bends, depending on whether a and b are on opposite, adjacent, or the same side of the bounding rectangle). Here, we show that P can be reconfigured to any other simple s,t path of 𝔾 by switching 2× 2 squares, where at most 5|𝔾|/4 such operations are required. Furthermore, each square-switch is done in O(1) time and keeps the resulting path in the same family of simple s,t paths. Our reconfiguration result proves that the Hamiltonian path graph G for simple s,t paths is connected and has diameter at most 5|𝔾|/4 which is asymptotically tight.


page 1

page 2

page 3

page 4


The Longest (s, t)-paths of O-shaped Supergrid Graphs

In this paper, we continue the study of the Hamiltonian and longest (s, ...

Simple Necessary Conditions for the Existence of a Hamiltonian Path with Applications to Cactus Graphs

We describe some necessary conditions for the existence of a Hamiltonian...

Unfolding Orthotubes with a Dual Hamiltonian Path

An orthotube consists of orthogonal boxes (e.g., unit cubes) glued face-...

Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time

A supergrid graph is a finite vertex-induced subgraph of the infinite gr...

Intersection Graphs of Non-crossing Paths

We study graph classes modeled by families of non-crossing (NC) connecte...

Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid

A graph G is called an edge intersection graph of paths on a grid if the...

The space of sections of a smooth function

Given a compact manifold X with boundary and a submersion f : X → Y whos...