C-shaped supergrid graphs are always Hamiltonian and almost always Hamiltonian connected; the exceptions are listed, and the longest path between any two vertices can be computed in linear time.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time
C-shaped supergrid graphs are always Hamiltonian and almost always Hamiltonian connected; the exceptions are listed, and the longest path between any two vertices can be computed in linear time.