Graph Minors. XX. Wagner's conjecture

By N. Robertson, Paul D. Seymour. J. Comb. Theory B, 2004

992 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/8914ad76ef8aa0bc5a355031d5ed235065641bfe

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Bernd Sturmfels
2. Seth Sullivant
3. Andries E. Brouwer
4. Arie M. C. A. Koster
5. Hans L. Bodlaender
6. Willem H. Haemers
7. Paul D. Seymour
8. Sebastian M. Cioaba

In Discrete Mathematics and Combinatorics

1. Andries E. Brouwer
2. Bernd Sturmfels
3. Willem H. Haemers
4. Daniel Marx

Citations in the corpus

• Graph minors XXIII. Nash-Williams' immersion conjecture (2010, background): “If all the hypergraphs G i are loopless graphs (that is, every edge has two ends) and there is a collapse of G j to G i then G i is isomorphic to a minor of G j in the usual sense of graph minors; and so 1.2 contains Wagner's conjecture (see [6]), at least for loopless graphs.”
• Spectra of Graphs (2011, background): “A deep theorem of Robertson and Seymour [317] states that for every graph property P that is closed under taking graph minors, there exists a finite list of graphs such that a”
• Toric geometry of cuts and splits (2006, background): “By the Robertson–Seymour theorem on graph minors [17], we may hope to characterize the class of graphs whose cut ideals satisfy some algebraic property by a finite list of excluded minors.”
• Combinatorial Optimization on Graphs of Bounded Treewidth (2008, background): “A very useful tool for these algorithms on planar graphs is the ratcatcher algorithm by Seymour and Thomas [88].”