Graph Minors. XXII. Irrelevant vertices in linkage problems

2011/08/13 by Neil Robertson, Paul Seymour · 39 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Computational Geometry and Mesh Generation #Discrete mathematics #Graph #Graph minor #Graph power #Lemma (botany) #Line graph #Mathematics #Optimization and Search Problems #Outerplanar graph #Planar graph #Vertex (graph theory) #Voltage graph

paper · pdf · doi:10.1016/j.jctb.2007.12.007

published in Journal of Combinatorial Theory, Series B 102(2), 530-563 (Elsevier BV)

openalex publication_date 2011/08/13 · crossref created 2011/08/13 · crossref issued 2012/03/01 · crossref published 2012/03/01 · crossref published-print 2012/03/01 · crossref deposited 2018/11/30 · openalex created_date 2025/10/10 · crossref indexed 2026/01/18 · openalex updated_date 2026/08/02

Citations

• Graph minors. VI. Disjoint paths across a disc
• Graph minors. VII. Disjoint paths on a surface
• Graph Minors .XIII. The Disjoint Paths Problem
• Graph Searching and a Min-Max Theorem for Tree-Width
• Graph Minors .XII. Distance on a Surface
• Graph Minors .XIV. Extending an Embedding
• Graph minors. X. Obstructions to tree-decomposition
• Graph minors. XXI. Graphs with unique linkages

Cited by

• Graph structure theorem [wikipedia]