Graph Minors. XIX. Well-quasi-ordering on a surface
- 1 March 2004
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 90 (2) , 325-385
- https://doi.org/10.1016/j.jctb.2003.08.005
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Graph Minors. XVIII. Tree-decompositions and well-quasi-orderingJournal of Combinatorial Theory, Series B, 2003
- Graph MinorsJournal of Combinatorial Theory, Series B, 1999
- Graph Minors .XIV. Extending an EmbeddingJournal of Combinatorial Theory, Series B, 1995
- Graph Minors .XII. Distance on a SurfaceJournal of Combinatorial Theory, Series B, 1995
- Graph Minors. XI. Circuits on a SurfaceJournal of Combinatorial Theory, Series B, 1994
- Graph minors. X. Obstructions to tree-decompositionJournal of Combinatorial Theory, Series B, 1991
- Graph minors. VIII. A kuratowski theorem for general surfacesJournal of Combinatorial Theory, Series B, 1990
- Graph minors. IV. Tree-width and well-quasi-orderingJournal of Combinatorial Theory, Series B, 1990
- Graph minors. VII. Disjoint paths on a surfaceJournal of Combinatorial Theory, Series B, 1988
- Graph minors. VI. Disjoint paths across a discJournal of Combinatorial Theory, Series B, 1986