Hamiltonian Paths in Some Classes of Grid Graphs

Fatemeh Keshavarz-Kohjerdi and Alireza Bagheri

Journal of Applied Mathematics, 2012, vol. 2012, issue 1

Abstract: 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.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2012/475087

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2012:y:2012:i:1:n:475087

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().