Hamiltonian Paths in Two Classes of Grid Graphs
arXiv:1107.1780
Abstract
In this paper, we give the necessary and sufficient conditions for the existence of Hamiltonian paths in alphabet and alphabet grid graphs. We also present a linear-time algorithm for finding Hamiltonian paths in these graphs.
arXiv comment11pages, 7figures