2000 character limit reached
Hamiltonian Paths in Two Classes of Grid Graphs (1107.1780v1)
Published 9 Jul 2011 in cs.DS
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.