Hamiltonian Paths in Some Classes of Grid Graphs

[摘要] The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we give necessary and sufficient conditions for the existence of Hamiltonian paths inL-alphabet,C-alphabet,F-alphabet, andE-alphabet grid graphs. We also present linear-time algorithms for finding Hamiltonian paths in these graphs.

[学科分类] 应用数学