5 citations · 5 across the 6 of their papers we have counts for
7 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 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…
Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes
Ruo-Wei Hung
The -dimensional hypercube network is one of the most popular interconnection networks since it has simple structure and is easy to implement. The -dimensional locally…
Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes
Ruo-Wei Hung
The hypercube is one of the most popular interconnection networks since it has simple structure and is easy to implement. The -dimensional twisted cube, denoted by , an im…
A Linear-Time Algorithm for the Maximum Matched-Paired-Domination Problem in Cographs
Ruo-Wei Hung, Chih-Chia Yao
Let be a graph without isolated vertices. A matching in is a set of independent edges in . A perfect matching in is a matching such that every vertex of $G…