Graph minors. IV. Tree-width and well-quasi-ordering

1990/04/01 by Neil Robertson, Paul Seymour, P.D Seymour · 106 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Conjecture #Countable set #Discrete mathematics #Graph #Graph theory and applications #Humanities #Kruskal's algorithm #Limits and Structures in Graph Theory #Mathematics #Minor (academic) #Planar graph #Sequence (biology) #Spanning tree #Tree (set theory)

paper · doi:10.1016/0095-8956(90)90120-o

published in Journal of Combinatorial Theory, Series B 48(2), 227-254 (Elsevier BV)

crossref issued 1990/04/01 · crossref published 1990/04/01 · crossref published-print 1990/04/01 · openalex publication_date 1990/04/01 · crossref created 2004/12/22 · crossref deposited 2019/01/30 · openalex created_date 2025/10/10 · crossref indexed 2026/08/07 · openalex updated_date 2026/08/08

Citations

• Graph minors. III. Planar tree-width
• Graph minors. II. Algorithmic aspects of tree-width
• Graph minors. VIII. A kuratowski theorem for general surfaces
• Graph minors. V. Excluding a planar graph

Cited by

• Graph minors. VIII. A kuratowski theorem for general surfaces
• Some Recent Progress and Applications in Graph Minor Theory
• Graph Minors. XIX. Well-quasi-ordering on a surface
• Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering
• Graph structure theorem [wikipedia]