Hamiltonian Paths in Two Classes of Grid Graphs
  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. 
Fatemeh Keshavarz-Kohjerdi and Alireza Bagheri
cs.DS