# Hamilton Paths in Grid Graphs

- 1982

#### 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

Citations per Year

#### 314 Citations

Semantic Scholar estimates that this publication has received between

**237**and**416**citations based on the available data.See our **FAQ** for additional information.