Graph Minors. XVI. Excluding a non-planar graph

2003/04/30 by Neil Robertson, Paul Seymour, P.D Seymour · 13 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Combinatorics #Computational Geometry and Mesh Generation #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Graph minor #Humanities #Line graph #Mathematics #Minor (academic) #Outerplanar graph #Pathwidth #Philosophy #Planar graph #Robertson–Seymour theorem #Voltage graph

paper · pdf · doi:10.1016/s0095-8956(03)00042-x

openalex publication_date 2003/04/30 · crossref created 2003/04/30 · crossref issued 2003/09/01 · crossref published 2003/09/01 · crossref published-print 2003/09/01 · crossref deposited 2019/03/21 · openalex created_date 2025/10/10 · crossref indexed 2026/06/26 · openalex updated_date 2026/08/01

Citations

• A Combinatorial Problem in Geometry
• Über eine Eigenschaft der ebenen Komplexe

Cited by

• Linearity of grid minors in treewidth with applications through bidimensionality
• Grad and classes with bounded expansion II. Algorithmic aspects
• Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
• The price of homogeneity is polynomial
• Quickly excluding an annotated planar graph
• The Graph Minor Algorithm with Parity Conditions
• Graph minor theory
• A partial k-arboretum of graphs with bounded treewidth
• Basis Number of Graphs Excluding Minors
• Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
• Minor-Closed Graph Classes with Bounded Layered Pathwidth
• On graphs with a simple structure of maximal cliques
• Graph minor [wikipedia]
• Pathwidth [wikipedia]