Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 515

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Hamilton Paths in Grid Graphs

Open access
Itai, Alon, Papadimitriou, Christos H., Szwarcfiter, Jayme Luiz · 1982 · SIAM Journal on Computing

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/0211056

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

See all 515

Metadata

Authors
Itai, A., Papadimitriou, C. H., & Szwarcfiter, J. L.
Venue
SIAM Journal on Computing
Published
1982-11
Volume
11
Issue
4
Pages
676-686
ISSN
  • 0097-5397 (ISSN-L)
  • 1095-7111
OpenAlex
W2055336889
Cited by
515
References
3
FWCI
5.40
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Hamilton Paths in Grid Graphs. https://app.cochat.ai/papers/10.1137/0211056
The paper
Itai, A., Papadimitriou, C. H., & Szwarcfiter, J. L. (1982). Hamilton Paths in Grid Graphs. SIAM Journal on Computing. https://doi.org/10.1137/0211056

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.