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

by   Ruo-Wei Hung, et al.

In this paper, we continue the study of the Hamiltonian and longest (s, t)-paths of supergrid graphs. The Hamiltonian (s, t)-path of a graph is a Hamiltonian path between any two given vertices s and t in the graph, and the longest (s, t)-path is a simple path with the maximum number of vertices from s to t in the graph. A graph holds Hamiltonian connected property if it contains a Hamiltonian (s, t)-path. These two problems are well-known NP-complete for general supergrid graphs. An O-shaped supergrid graph is a special kind of a rectangular grid graph with a rectangular hole. In this paper, we first prove the Hamiltonian connectivity of O-shaped supergrid graphs except few conditions. We then show that the longest (s, t)-path of an O-shaped supergrid graph can be computed in linear time. The Hamiltonian and longest (s, t)-paths of O-shaped supergrid graphs can be applied to compute the minimum trace of computerized embroidery machine and 3D printer when a hollow object is printed.


The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs

Supergrid graphs contain grid graphs and triangular grid graphs as their...

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

A simple s,t path P in a rectangular grid graph 𝔾 is a Hamiltonian path ...

Basis for a vector space generated by Hamiltonian time paths in a complete time graph

In this paper we introduce the notion of a complete time graph of order ...

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

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

More relations between λ-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs

This paper deals with the λ-labeling and L(2,1)-coloring of simple graph...

Hamiltonian Maker-Breaker games on small graphs

We look at the unbiased Maker-Breaker Hamiltonicity game played on the e...

Please sign up or login with your details

Forgot password? Click here to reset