Open Access
2012 Hamiltonian Paths in Some Classes of Grid Graphs
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
J. Appl. Math. 2012: 1-17 (2012). DOI: 10.1155/2012/475087


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 in L-alphabet, C-alphabet, F-alphabet, and E-alphabet grid graphs. We also present linear-time algorithms for finding Hamiltonian paths in these graphs.


Download Citation

Fatemeh Keshavarz-Kohjerdi. Alireza Bagheri. "Hamiltonian Paths in Some Classes of Grid Graphs." J. Appl. Math. 2012 1 - 17, 2012.


Published: 2012
First available in Project Euclid: 14 December 2012

zbMATH: 1245.05081
MathSciNet: MR2915722
Digital Object Identifier: 10.1155/2012/475087

Rights: Copyright © 2012 Hindawi

Vol.2012 • 2012
Back to Top