Hamiltonian Paths in C-shaped Grid Graphs
Computational Complexity
2016-02-25 v1
Abstract
We study the Hamiltonian path problem in C-shaped grid graphs, and present the necessary and sufficient conditions for the existence of a Hamiltonian path between two given vertices in these graphs. We also give a linear-time algorithm for finding a Hamiltonian path between two given vertices of a C-shaped grid graph, if it exists.
Cite
@article{arxiv.1602.07407,
title = {Hamiltonian Paths in C-shaped Grid Graphs},
author = {Fatemeh Keshavarz-Kohjerdi and Alireza Bagheri},
journal= {arXiv preprint arXiv:1602.07407},
year = {2016}
}
Comments
28 pages, 31 figures, and 20 references