Graph Minors. XX. Wagner's conjecture

Authors:
Neil Robertson;P. D. Seymour
Affiliations:
Department of Mathematics, Ohio State University, 231 West 18th Ave., Columbus, OH;Mathematics Department, Princeton University, 201 Fine Hall, Princeton, NJ and Telcordia Technologies, 445 South St., Morristown, NJ
Venue:
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Year:
2004

Citing 5
Cited 104

Graph minors. IV. Tree-width and well-quasi-ordering

Journal of Combinatorial Theory Series B
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Graph minors

Journal of Combinatorial Theory Series B
Graph minors. XVIII. tree-decompositions and well-quasi-ordering

Journal of Combinatorial Theory Series B
Graph Minors. XIX. Well-quasi-ordering on a surface

Journal of Combinatorial Theory Series B

On the Complements of Partial k-Trees

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On the structure of k-connected graphs without Kk-minor

European Journal of Combinatorics - Special issue: Topological graph theory II
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A semidefinite programming approach to tensegrity theory and realizability of graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Subgraph characterization of red/blue-split graph and kőnig egerváry graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Trees, grids, and MSO decidability: from graphs to matroids

Theoretical Computer Science - Parameterized and exact computation
Reducing to independent set structure: the case of k-internal spanning tree

Nordic Journal of Computing
Graphs and obstructions in four dimensions

Journal of Combinatorial Theory Series B
Minimal universal and dense minor closed classes

European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
Vertex-minors, monadic second-order logic, and a conjecture by Seese

Journal of Combinatorial Theory Series B
On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture

Journal of Combinatorial Theory Series B
Quickly deciding minor-closed parameters in general graphs

European Journal of Combinatorics
Maximum matching in graphs with an excluded minor

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Biased graphs. VII. Contrabalance and antivoltages

Journal of Combinatorial Theory Series B
Vertex-minor reductions can simulate edge contractions

Discrete Applied Mathematics
Redundancy in logic II: 2CNF and Horn propositional formulae

Artificial Intelligence
Computing excluded minors

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Every minor-closed property of sparse graphs is testable

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Graph and map isomorphism and all polyhedral embeddings in linear time

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Improved upper bounds on the crossing number

Proceedings of the twenty-fourth annual symposium on Computational geometry
Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Solving problems on recursively constructed graphs

ACM Computing Surveys (CSUR)
On tree width, bramble size, and expansion

Journal of Combinatorial Theory Series B
Excluding a group-labelled graph

Journal of Combinatorial Theory Series B
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes

Graph-Theoretic Concepts in Computer Science
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation

Discrete Applied Mathematics
Graph minors. XXI. Graphs with unique linkages

Journal of Combinatorial Theory Series B
Finite planar emulators for K4,5-4K2 and K1,2,2,2 and Fellows' Conjecture

European Journal of Combinatorics
Algorithmic and Analysis Techniques in Property Testing

Foundations and Trends® in Theoretical Computer Science
Graph minors XXIII. Nash-Williams' immersion conjecture

Journal of Combinatorial Theory Series B
Obtaining a planar graph by vertex deletion

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Wheel-free deletion is W[2]-hard

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Optimization and recognition for K5-minor free graphs in linear time

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs

European Journal of Combinatorics
Linkless and flat embeddings in 3-space and the unknot problem

Proceedings of the twenty-sixth annual symposium on Computational geometry
Single source shortest paths in H-minor free graphs

Theoretical Computer Science
Note: A decidability result for the dominating set problem

Theoretical Computer Science
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Path separability of graphs

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Faster approximation schemes and parameterized algorithms on H-minor-free and odd-minor-free graphs

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Fast minor testing in planar graphs

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Contractions of planar graphs in polynomial time

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
A well-quasi-order for tournaments

Journal of Combinatorial Theory Series B
Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice
From polynomial time queries to graph structure theory

Communications of the ACM
Sublinear graph approximation algorithms

Property testing
Sublinear graph approximation algorithms

Property testing
A simpler algorithm and shorter proof for the graph minor decomposition

Proceedings of the forty-third annual ACM symposium on Theory of computing
Minors in random and expanding hypergraphs

Proceedings of the twenty-seventh annual symposium on Computational geometry
Preface

European Journal of Combinatorics
The maximal linear extension theorem in second order arithmetic

Archive for Mathematical Logic
Well-quasi-ordering hereditarily finite sets

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Note: On self-duality of branchwidth in graphs of bounded genus

Discrete Applied Mathematics
Enumeration of minimal dominating sets and variants

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Grid classes and partial well order

Journal of Combinatorial Theory Series A
Faster parameterized algorithms for minor containment

Theoretical Computer Science
Nested cycles in large triangulations and crossing-critical graphs

Journal of Combinatorial Theory Series B
Finite dualities and map-critical graphs on a fixed surface

Journal of Combinatorial Theory Series B
Combinatorial optimization with 2-joins

Journal of Combinatorial Theory Series B
List-coloring graphs without subdivisions and without immersions

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs

Theoretical Computer Science
On matroid representability and minor problems

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth

GD'04 Proceedings of the 12th international conference on Graph Drawing
Outerplanar obstructions for a feedback vertex set

European Journal of Combinatorics
Forbidden graphs for tree-depth

European Journal of Combinatorics
Faster parameterized algorithms for minor containment

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On graph contractions and induced minors

Discrete Applied Mathematics
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A polynomial time algorithm for bounded directed pathwidth

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Combinatorial auctions with restricted complements

Proceedings of the 13th ACM Conference on Electronic Commerce
Reoptimization of some maximum weight induced hereditary subgraph problems

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Research paper: The saga of minimum spanning trees

Computer Science Review
Locally constrained graph homomorphisms-structure, complexity, and applications

Computer Science Review
Submodular minimization via pathwidth

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Well-quasi-ordering of matrices under Schur complement and applications to directed graphs

European Journal of Combinatorics
Fixed-Parameter tractability, a prehistory,

The Multivariate Algorithmic Revolution and Beyond
Fixed-Parameter tractability of treewidth and pathwidth

The Multivariate Algorithmic Revolution and Beyond
Graph minors and parameterized algorithm design

The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity

The Multivariate Algorithmic Revolution and Beyond
The theory of WSTS: the case of complete WSTS

PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
A single-exponential FPT algorithm for the K4- minor cover problem

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
The gram dimension of a graph

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Obtaining planarity by contracting few edges

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Fixed-point definability and polynomial time on graphs with excluded minors

Journal of the ACM (JACM)
Connected graph searching

Information and Computation
The power of counting logics on restricted classes of finite structures

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
The circumference of a graph with no K3,t-minor, II

Journal of Combinatorial Theory Series B
Span programs and quantum algorithms for st-connectivity and claw detection

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

European Journal of Combinatorics
On tractable parameterizations of graph isomorphism

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Well-structured graph transformation systems with negative application conditions

ICGT'12 Proceedings of the 6th international conference on Graph Transformations
On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction

Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Classes of locally finite ubiquitous graphs

Journal of Combinatorial Theory Series B
Obtaining planarity by contracting few edges

Theoretical Computer Science
Coalition structure generation over graphs

Journal of Artificial Intelligence Research
Testing subdivision-freeness: property testing meets structural graph theory

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A quasi-polynomial time partition oracle for graphs with an excluded minor

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Effective computation of immersion obstructions for unions of graph classes

Journal of Computer and System Sciences
On the subgraph epimorphism problem

Discrete Applied Mathematics
Preprocessing subgraph and minor problems: When does a small vertex cover help?

Journal of Computer and System Sciences
Reoptimization of maximum weight induced hereditary subgraph problems

Theoretical Computer Science
Chromatic number and complete graph substructures for degree sequences

Combinatorica
Multigraded commutative algebra of graph decompositions

Journal of Algebraic Combinatorics: An International Journal
Square roots of minor closed graph classes

Discrete Applied Mathematics

Quantified Score

Hi-index	0.02

Visualization

Abstract

We prove Wagner's conjecture, that for every infinite set of finite graphs, one of its members is isomorphic to a minor of another.