The Hamiltonian path problem is a well-known NP-complete problem.
We give necessary and sufficient conditions for the existence of a Hamiltonian (s,t)-path in L-shaped grid graphs.
We show that a Hamiltonian (s,t)-path in L-shaped grid graph can be computed in linear time if it does exist.