The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Efficient Planarity Testing
Open accessAbstract
This paper describes an efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane. The algorithm may be viewed as an iterative version of a method originally proposed by Auslander and Parter and correctly formulated by Goldstein. The algorithm used depth-first search and has O ( V ) time and space bounds, where V is the number of vertices in G . An ALGOL implementation of the algorithm succesfully tested graphs with as many as 900 vertices in less than 12 seconds.
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.
Integrity signals
Registry
Cites
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.
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
Harary, F. (1969) · Cited by 10,739
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
Self-citationHarary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
Complexity of Computer Computations
(1972) · Springer eBooks · doi:10.1007/978-1-4684-2001-2 · Cited by 2,781
Ore, Ö. (1962) · Medical Entomology and Zoology · Cited by 1,529
Tutte, W. T. (1963) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s3-13.1.743 · Cited by 1,114
Sur le problème des courbes gauches en Topologie
Kuratowski, C. (1930) · Fundamenta Mathematicae · doi:10.4064/fm-15-1-271-283 · Cited by 1,025
Algorithm 447: efficient algorithms for graph manipulation
Hopcroft, J., & Tarjan, R. (1973) · Communications of the ACM · doi:10.1145/362248.362272 · Cited by 985
Self-citationThe Theory of Graphs and Its Applications
Burger, E., Berge, C., & Doig, A. (1965) · Econometrica · doi:10.2307/1911908 · Cited by 897
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
Hopcroft, J. (1971) · Theory of Machines and Computations · doi:10.1016/b978-0-12-417750-5.50022-1 · Cited by 747
Self-citation
Cited by
Graph visualization and navigation in information visualization: A survey
Herman, I., Melancon, G., & Marshall, M. S. (2000) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.841119 · Cited by 1,538
Booth, K. S., & Lueker, G. S. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80045-1 · Cited by 1,488
Algorithms for drawing graphs: an annotated bibliography
Battista, G. D., Eades, P., Tamassia, R., & Tollis, I. G. (1994) · Computational Geometry · doi:10.1016/0925-7721(94)00014-x · Cited by 854
Xiao, X., Zhu, W., Liao, B., Xu, J., Gu, C., Ji, B., Yao, Y., Peng, L., & Yang, J. (2018) · Frontiers in Genetics · doi:10.3389/fgene.2018.00411 · Cited by 47
Metadata
- Authors
- Hopcroft, J., & Tarjan, R.
- Venue
- Journal of the ACM
- Published
- 1974-10
- Volume
- 21
- Issue
- 4
- Pages
- 549-568
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1987374783
- Cited by
- 1,081
- References
- 14
- FWCI
- 10.62
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Efficient Planarity Testing. https://app.cochat.ai/papers/10.1145/321850.321852
- The paper
- Hopcroft, J., & Tarjan, R. (1974). Efficient Planarity Testing. Journal of the ACM. https://doi.org/10.1145/321850.321852
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.
