1. Graph minors. I. Excluding a forest;Robertson;J. Combin. Theory Ser. B,1983
2. N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, submitted.
3. N. Robertson and P. D. Seymour, Graph minors. IV. Tree-width and well-quasiordering, submitted.
4. N. Robertson and P. D. Seymour, Graph minors. V. Excluding a planar graph, submitted.
5. N. Robertson and P. D. Seymour, Graph minors. VI. Disjoint paths on a surface, in preparation.