Graph minors. XIX. Well-quasi-ordering on a surface

Journal of Combinatorial Theory. Series B

Volumn 90, Issue 2, 2004, Pages 325-385

  Robertson, Neil ^a   Seymour, P D ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1442330929     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2003.08.005     Document Type: Article

References (11)

1. N. Robertson, P.D. Seymour, Graph Minors. VI. Disjoint paths across a disc, J. Combin. Theory Ser. B 41 (1986) 115-138.
2. N. Robertson, P.D. Seymour, Graph Minors. VII. Disjoint paths on a surface, J. Combin. Theory Ser. B 45 (1988) 212-254.
3. N. Robertson, P.D. Seymour, Graph Minors IV. Tree-width and well-quasi-ordering, J. Combin. Theory Ser. B 48 (1990) 227-254.
4. N. Robertson, P.D. Seymour, Graph Minors. VIII. A Kuratowski theorem for general surfaces, J. Combin. Theory Ser. B 48 (1990) 255-288.
5. N. Robertson, P.D. Seymour, Graph Minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B 52 (1991) 153-190.
6. N. Robertson, P.D. Seymour, Graph Minors. XI. Circuits on a surface, J. Combin. Theory Ser. B 60 (1994) 72-106.
7. N. Robertson, P.D. Seymour, Graph Minors. XII. Distance on a surface, J. Combin. Theory Ser. B 64 (1995) 240-272.
8. N. Robertson, P.D. Seymour, Graph Minors. XIV. Extending an embedding, J. Combin. Theory Ser. B 65 (1995) 23-50.
9. N. Robertson, P.D. Seymour, Graph Minors. XVII. Taming a vortex, J. Combin. Theory Ser. B 77 (1999) 162-210.
10. N. Robertson, P.D. Seymour, Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering, J. Combin. Theory Ser. B 89 (2003) 77-108.
11. N. Robertson, P.D. Seymour, Graph Minors. XX. Wagner's conjecture, submitted for publication.