Hamiltonian Paths in Some Classes of Grid Graphs

Fatemeh Keshavarz-Kohjerdi and Alireza Bagheri

Journal of Applied Mathematics, 2012, vol. 2012, 1-17

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)
http://downloads.hindawi.com/journals/JAM/2012/475087.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2012/475087.xml (text/xml)

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:hin:jnljam:475087

DOI: 10.1155/2012/475087

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().