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

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

Steiner's problem in graphs and its implications

Hakimi, S. L.·1971·Networks
DOI 10.1002/net.3230010203
Open this paper in CoChat — free account

Abstract

A graph theoretic version of Steiner's problem in plane geometry is described. An approach for solving this problem, related to Melzak's solution to Steiner's problem, is presented. The problems of finding “shortest route” and “minimal spanning tree” in graphs become special cases of the Steiner's problem in graphs. It is shown that a solution to this problem also provides us with a solution to the problems of finding a minimum externally stable set and a maximum internally stable set in a graph.

Overview

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1002/net.3230010203

Cites

17 of 17 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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 17 references

Cited by

See all 347

Metadata

Authors
Hakimi, S. L.
Venue
Networks
Publisher
Wiley
Published
1971-01
Volume
1
Issue
2
Pages
113-133
ISSN
  • 0028-3045 (ISSN-L)
  • 1097-0037
DOI
10.1002/net.3230010203
OpenAlex
W2132087752
Cited by
347
References
17
FWCI
2.83
Type
journal article
Language
en
Open access
closed

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: Steiner's problem in graphs and its implications. https://app.cochat.ai/papers/10.1002/net.3230010203
The paper
Hakimi, S. L. (1971). Steiner's problem in graphs and its implications. Networks. https://doi.org/10.1002/net.3230010203

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.