The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Graph minors. II. Algorithmic aspects of tree-width
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
Complexity of Finding Embeddings in a k-Tree
Arnborg, S., Corneil, D. G., & Proskurowski, A. (1987) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0608024 · Cited by 1,206
Graph minors. III. Planar tree-width
Robertson, N., & Seymour, P. D. (1984) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(84)90013-3 · Cited by 718
Self-citationOn the Computational Complexity of Combinatorial Problems
Karp, R. M. (1975) · Networks · doi:10.1002/net.1975.5.1.45 · Cited by 711
Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
Kruskal, J. B. (1960) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1960-0111704-1 · Cited by 497
The equivalence of theorem proving and the interconnection problem
Lynch, J. F. (1975) · ACM SIGDA Newsletter · doi:10.1145/1061425.1061430 · Cited by 152
Cited by
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Bodlaender, H. L. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539793251219 · Cited by 1,542
PARAMETERIZED COMPLEXITY THEORY
Niedermeier, R. (2006) · Invitation to Fixed-Parameter Algorithms · doi:10.1093/acprof:oso/9780198566076.003.0013 · Cited by 574
Simulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
Tree-Like Structure in Large Social and Information Networks
Adcock, A. B., Sullivan, B. D., & Mahoney, M. W. (2013) · 2013 IEEE 13th International Conference on Data Mining · doi:10.1109/icdm.2013.77 · Cited by 141
Next-Generation Topology of D-Wave Quantum Processors
Boothby, K., Bunyk, P., Raymond, J., & Roy, A. (2020) · arXiv · doi:10.48550/arxiv.2003.00133 · Cited by 125
“One measure of the complexity of a graph is its treewidth [3].”
Background
Metadata
- Authors
- Robertson, N., & Seymour, P. D.
- Venue
- Journal of Algorithms
- Publisher
- Elsevier BV
- Published
- 1986-09
- Volume
- 7
- Issue
- 3
- Pages
- 309-322
- ISSN
- 0196-6774 (ISSN-L)
- OpenAlex
- W2029448190
- Cited by
- 1,542
- References
- 5
- FWCI
- 7.16
- 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: Graph minors. II. Algorithmic aspects of tree-width. https://app.cochat.ai/papers/10.1016/0196-6774(86)90023-4
- The paper
- Robertson, N., & Seymour, P. D. (1986). Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms. https://doi.org/10.1016/0196-6774(86)90023-4
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.
