Hamilton Paths in Grid Graphs

Abstract

A grid graph is a node-induced finite subgraph of the infinite grid. It is rectangular if its set of nodes is the product of two intervals. Given a rectangular grid graph and two of its nodes, we give necessary and sufficient conditions for the graph to have a Hamilton path between these two nodes. In contrast, the Hamilton path (and circuit) problem for general grid graphs is shown to be NP-complete. This provides a new, relatively simple, proof of the result that the Euclidean traveling salesman problem is NP-complete.

DOI: 10.1137/0211056

Extracted Key Phrases

10 Figures and Tables

0102030'82'85'89'93'97'01'05'09'13'17
Citations per Year

312 Citations

Semantic Scholar estimates that this publication has 312 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Itai1982HamiltonPI, title={Hamilton Paths in Grid Graphs}, author={Alon Itai and Christos H. Papadimitriou and Jayme Luiz Szwarcfiter}, journal={SIAM J. Comput.}, year={1982}, volume={11}, pages={676-686} }