ResearchIndex Home D. Bienstock, N. Robertson, P. Seymour, R. Thomas, Quickly excluding a forest , J. Combin.
H contains T as a minor if and only if H contains T as a subdivision.
D. Bienstock, N. Robertson, P. Seymour, R. Thomas, Quickly excluding a forest , J. Combin. Further we use the word graph to denote a finite connected topological graph, embedded in R 3 . For simplicity, we shall assume that edges of a graph are polygonal lines. Quickly excluding a forest . We mention some of these results, that fit in the framework of this paper.