Editing Robertson–Seymour theorem (section)

==References==
*{{citation
 | last1 = Bienstock | first1 = Daniel
 | last2 = Langston | first2 = Michael A. | author2-link = Michael Langston
 | contribution = Algorithmic implications of the graph minor theorem
 | doi = 10.1016/S0927-0507(05)80125-2
 | pages = 481–502
 | series = Handbooks in Operations Research and Management Science
 | title = Network Models
 | contribution-url = http://www.cs.utk.edu/~langston/courses/cs594-fall2003/BL.pdf
 | volume = 7
 | year = 1995| isbn = 978-0-444-89292-8
 }}.
*{{citation
 | last = Diestel | first = Reinhard | author-link = Reinhard Diestel
 | contribution = Minors, Trees, and WQO
 | edition = Electronic Edition 2005
 | pages = 326–367
 | publisher = Springer
 | title = Graph Theory
 | url = http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/preview/Ch12.pdf
 | year = 2005}}.
*{{citation
 | last1 = Fellows | first1 = Michael R. | author1-link = Michael Fellows
 | last2 = Langston | first2 = Michael A. | author2-link = Michael Langston
 | doi = 10.1145/44483.44491
 | issue = 3
 | journal = [[Journal of the ACM]]
 | pages = 727–739
 | title = Nonconstructive tools for proving polynomial-time decidability
 | volume = 35
 | year = 1988| doi-access = free
 }}.
*{{citation
 | last1 = Friedman | first1 = Harvey | author1-link = Harvey Friedman (mathematician)
 | last2 = Robertson | first2 = Neil | author2-link = Neil Robertson (mathematician)
 | last3 = Seymour | first3 = Paul | author3-link = Paul Seymour (mathematician)
 | contribution = The metamathematics of the graph minor theorem
 | editor-last = Simpson | editor-first = S.
 | pages = 229–261
 | publisher = [[American Mathematical Society]]
 | series = Contemporary Mathematics
 | title = Logic and Combinatorics
 | volume = 65
 | year = 1987}}.
*{{citation
 | last1 = Kawarabayashi |first1 = Ken-ichi | author1-link = Ken-ichi Kawarabayashi
 | last2 = Kobayashi | first2 = Yusuke
 | last3 = Reed | first3 = Bruce | author3-link = Bruce Reed (mathematician)
 | title = The disjoint paths problem in quadratic time
 | journal = Journal of Combinatorial Theory, Series B
 | volume = 102
 | issue  = 2
 | year = 2012
 | pages = 424–435
 | doi = 10.1016/j.jctb.2011.07.004
 | url = http://research.nii.ac.jp/~k_keniti/quaddp1.pdf| doi-access = free
 }}.
*{{citation
 | last = Lovász | first = László | author-link = László Lovász
 | doi = 10.1090/S0273-0979-05-01088-8
 | issue = 1
 | journal = Bulletin of the American Mathematical Society |series=New Series
 | pages = 75–86
 | title = Graph Minor Theory
 | volume = 43
 | year = 2005| doi-access = free
 }}.
*{{citation
 | last1 = Myrvold | first1 = Wendy | author1-link = Wendy Myrvold
 | last2 = Woodcock | first2 = Jennifer
 | doi = 10.37236/3797
 | url = https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p16
 | issue = 1
 | journal = The Electronic Journal of Combinatorics
 | title =  A Large Set of Torus Obstructions and How They Were Discovered
 | pages = P1.16
 | volume = 25
 | year = 2018
 | doi-access = free
 }}.
*{{citation
 | last1 = Robertson | first1 = Neil | author1-link = Neil Robertson (mathematician)
 | last2 = Seymour | first2 = Paul | author2-link = Paul Seymour (mathematician)
 | doi = 10.1016/0095-8956(83)90079-5
 | issue = 1
 | journal = Journal of Combinatorial Theory, Series B
 | pages = 39–61
 | title = Graph Minors. I. Excluding a forest
 | volume = 35
 | year = 1983| doi-access = free
 }}.
*{{citation
 | last1 = Robertson | first1 = Neil | author1-link = Neil Robertson (mathematician)
 | last2 = Seymour | first2 = Paul | author2-link = Paul Seymour (mathematician)
 | doi = 10.1006/jctb.1995.1006
 | issue = 1
 | journal = Journal of Combinatorial Theory, Series B
 | pages = 65–110
 | title = Graph Minors. XIII. The disjoint paths problem
 | volume = 63
 | year = 1995| doi-access = free
 }}.
*{{citation
 | last1 = Robertson | first1 = Neil | author1-link = Neil Robertson (mathematician)
 | last2 = Seymour | first2 = Paul | author2-link = Paul Seymour (mathematician)
 | doi = 10.1016/j.jctb.2004.08.001
 | issue = 2
 | journal = Journal of Combinatorial Theory, Series B
 | pages = 325–357
 | title = Graph Minors. XX. Wagner's conjecture
 | volume = 92
 | year = 2004| doi-access = free
 }}.