Graph minors. VII. Disjoint paths on a surface

1988/10/01 by Neil Robertson, Paul Seymour, P.D Seymour · 107 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Bounded function #Combinatorics #Computational Geometry and Mesh Generation #Discrete mathematics #Disjoint sets #Geometry #Graph #Graph Labeling and Dimension Problems #Mathematical analysis #Mathematics #Surface (topology) #Vertex (graph theory)

paper · doi:10.1016/0095-8956(88)90070-6

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

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

Citations

• Graph minors. VI. Disjoint paths across a disc
• Graph minors. III. Planar tree-width
• Graph minors. VIII. A kuratowski theorem for general surfaces

Cited by

• Graph minors. VIII. A kuratowski theorem for general surfaces
• Some Recent Progress and Applications in Graph Minor Theory
• Graph Minors .XIV. Extending an Embedding
• Graph Minors. XXII. Irrelevant vertices in linkage problems
• Graph Minors. XIX. Well-quasi-ordering on a surface
• Graph minors. XXI. Graphs with unique linkages
• Graph structure theorem [wikipedia]