Graph minors. VI. Disjoint paths across a disc

1986/08/01 by Neil Robertson, Paul Seymour, P.D Seymour · 87 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Computational Geometry and Mesh Generation #Discrete mathematics #Disjoint sets #Graph #Graph Labeling and Dimension Problems #Mathematics #Vertex (graph theory)

paper · doi:10.1016/0095-8956(86)90031-6

published in Journal of Combinatorial Theory, Series B 41(1), 115-138 (Elsevier BV)

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

Cited by

• Graph minors. VII. Disjoint paths on a surface
• Graph minors. VIII. A kuratowski theorem for general surfaces
• Some Recent Progress and Applications in Graph Minor Theory
• Graph Minors. XXII. Irrelevant vertices in linkage problems
• Graph Minors. XIX. Well-quasi-ordering on a surface
• Graph structure theorem [wikipedia]