Hamiltonian Paths in Two Classes of Grid Graphs
classification
💻 cs.DS
keywords
graphshamiltonianpathsalphabetgridalgorithmclassesconditions
read the original abstract
In this paper, we give the necessary and sufficient conditions for the existence of Hamiltonian paths in $L-$alphabet and $C-$alphabet grid graphs. We also present a linear-time algorithm for finding Hamiltonian paths in these graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.