Graph minors. II. Algorithmic aspects of tree-width

1986/09/01 by Neil Robertson, Paul Seymour, P.D Seymour · 1,015 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Bounded function #Combinatorics #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Discrete mathematics #Mathematics #Time complexity

paper · doi:10.1016/0196-6774(86)90023-4

published in Journal of Algorithms 7(3), 309-322 (Elsevier BV)

crossref issued 1986/09/01 · crossref published 1986/09/01 · crossref published-print 1986/09/01 · openalex publication_date 1986/09/01 · crossref created 2005/02/10 · crossref deposited 2019/01/29 · openalex created_date 2025/10/10 · crossref indexed 2026/07/24 · openalex updated_date 2026/08/03

Citations

• Graph minors. III. Planar tree-width
• Searching and pebbling
• Graph minors. I. Excluding a forest
• Graph minors. V. Excluding a planar graph
• Complexity of Finding Embeddings in a k-Tree

Cited by

• The Tree-Width of Clique-Width Bounded Graphs without Kn,n
• Graph minors. IV. Tree-width and well-quasi-ordering
• Some Recent Progress and Applications in Graph Minor Theory
• Graph structure theorem [wikipedia]