5 citations · 5 across the 3 of their papers we have counts for
5 papers
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…
Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time
Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi
A supergrid graph is a finite vertex-induced subgraph of the infinite graph whose vertex set consists of all points of the plane with integer coordinates and in which two vertices…
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…
Hamiltonian Paths in C-shaped Grid Graphs
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
We study the Hamiltonian path problem in C-shaped grid graphs, and present the necessary and sufficient conditions for the existence of a Hamiltonian path between two given vertice…
Hamiltonian Paths in Two Classes of Grid Graphs
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
In this paper, we give the necessary and sufficient conditions for the existence of Hamiltonian paths in alphabet and alphabet grid graphs. We also present a linear-time al…