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

5 citations · 5 across the 2 of their papers we have counts for

collaborators
Showing cs.DMShow all

3 papers · 1 filter

cs.DM2019

The Longest -paths of -shaped Supergrid Graphs

Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi

In this paper, we continue the study of the Hamiltonian and longest -paths of supergrid graphs. The Hamiltonian -path of a graph is a Hamiltonian path between any t…

cs.DM2019★ 5 cited

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

Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung

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-complet…

cs.DM2015

Hamiltonian Cycles in Linear-Convex Supergrid Graphs

Ruo-Wei Hung

A supergrid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional supergrid. The supergrid graphs contain grid graphs and triangular grid gra…