Hamiltonian Paths in Two Classes of Grid Graphs
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.