Skip to main content
Journal ArticleOPEN ACCESS

Hamiltonian paths in some classes of grid graphs

Journal of Applied Mathematics (2012) 2012
DOI: 10.1155/2012/475087
20Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

This article is free to access.

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. Copyright © 2012 Fatemeh Keshavarz-Kohjerdi and Alireza Bagheri.

Cite

CITATION STYLE

APA

Keshavarz-Kohjerdi, F., & Bagheri, A. (2012). Hamiltonian paths in some classes of grid graphs. Journal of Applied Mathematics, 2012. https://doi.org/10.1155/2012/475087

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free