Graph minors. VIII. A kuratowski theorem for general surfaces

1990/04/01 by Neil Robertson, Paul Seymour, P.D Seymour · 82 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Chordal graph #Combinatorics #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #Mathematics #Robertson–Seymour theorem

paper · doi:10.1016/0095-8956(90)90121-f

published in Journal of Combinatorial Theory, Series B 48(2), 255-288 (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/06/26 · openalex updated_date 2026/07/23

Citations

• Sur le problème des courbes gauches en Topologie
• Graph minors. VI. Disjoint paths across a disc
• Graph minors. III. Planar tree-width
• Graph minors. VII. Disjoint paths on a surface
• Graph minors. IV. Tree-width and well-quasi-ordering
• Graph minors. V. Excluding a planar graph

Cited by

• New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
• Graph minors. VII. Disjoint paths on a surface
• Graph minors. IV. Tree-width and well-quasi-ordering
• Some Recent Progress and Applications in Graph Minor Theory
• Graph Minors. XIX. Well-quasi-ordering on a surface
• Graph structure theorem [wikipedia]