Hamiltonian Paths in Two Classes of Grid Graphs
Data Structures and Algorithms
2011-07-12 v1
Abstract
In this paper, we give the necessary and sufficient conditions for the existence of Hamiltonian paths in alphabet and alphabet grid graphs. We also present a linear-time algorithm for finding Hamiltonian paths in these graphs.
Cite
@article{arxiv.1107.1780,
title = {Hamiltonian Paths in Two Classes of Grid Graphs},
author = {Fatemeh Keshavarz-Kohjerdi and Alireza Bagheri},
journal= {arXiv preprint arXiv:1107.1780},
year = {2011}
}
Comments
11pages, 7figures