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

1 paper · 1 filter

cs.CC2019

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…