Graph Minors. XX. Wagner's conjecture

2004/11/01 by Neil Robertson, Paul Seymour, P.D. Seymour · 17 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Collatz conjecture #Combinatorics #Conjecture #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Law #Limits and Structures in Graph Theory #Mathematics #Minor (academic) #Political science

paper · doi:10.1016/j.jctb.2004.08.001

crossref issued 2004/11/01 · crossref published 2004/11/01 · crossref published-print 2004/11/01 · openalex publication_date 2004/11/01 · crossref created 2004/11/06 · crossref deposited 2019/02/02 · openalex created_date 2025/10/10 · crossref indexed 2026/07/15 · openalex updated_date 2026/07/23

Cited by

• Reconfiguring Subgraphs with Extra Resources
• Oddomorphisms, Split-Off Minors, and the Strong Roberson Conjecture
• Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
• Well-quasi-ordered classes of bounded clique-width
• Graph modification of bounded size to minor-closed classes as fast as vertex deletion
• On intrinsically knotted or completely 3-linked graphs
• REGULAR PROJECTIONS OF GRAPHS WITH AT MOST THREE DOUBLE POINTS
• Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
• The forbidden minor characterization of line-search antimatroids of rooted digraphs
• Local certification of graphs on surfaces
• Nested cycles in large triangulations and crossing-critical graphs
• Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
• Characterizing width two for variants of treewidth
• Knots and links in spatial graphs: A survey
• Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension
• Biased graphs. VII. Contrabalance and antivoltages
• More Forbidden Minors for Wye-Delta-Wye Reducibility
• Pathwidth [wikipedia]