DeepAI

# 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 subgraphs. The Hamiltonian cycle and path problems for general supergrid graphs were known to be NP-complete. A graph is called Hamiltonian if it contains a Hamiltonian cycle, and is said to be Hamiltonian connected if there exists a Hamiltonian path between any two distinct vertices in it. In this paper, we first prove that every L-shaped supergrid graph always contains a Hamiltonian cycle except one trivial condition. We then verify the Hamiltonian connectivity of L-shaped supergrid graphs except few conditions. The Hamiltonicity and Hamiltonian connectivity of L-shaped supergrid graphs can be applied to compute the minimum trace of computerized embroidery machine and 3D printer when a L-like object is printed. Finally, we present a linear-time algorithm to compute the longest (s, t)-path of L-shaped supergrid graph given two distinct vertices s and t.

• 3 publications
• 3 publications
11/16/2019

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

In this paper, we continue the study of the Hamiltonian and longest (s, ...
08/17/2019

### 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...
09/17/2018

### Hamiltonicity in Convex Bipartite Graphs

For a connected graph, the Hamiltonian cycle (path) is a simple cycle (p...
05/11/2022

### On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path

The decision problems of the existence of a Hamiltonian cycle or of a Ha...
05/17/2021

### Hamiltonian Cycle Problem is in P

In this paper we present the first deterministic polynomial time algorit...
08/25/2017

### Hamiltonian Maker-Breaker games on small graphs

We look at the unbiased Maker-Breaker Hamiltonicity game played on the e...
01/28/2022

### Unfolding Orthotubes with a Dual Hamiltonian Path

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