Robertson, Neil; Seymour, P. D. Graph minors. I. Excluding a forest. (English) Zbl 0521.05062 J. Comb. Theory, Ser. B 35, 39-61 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 18 ReviewsCited in 153 Documents MSC: 05C99 Graph theory 05C38 Paths and cycles Keywords:path-decomposition; path-width; minor; forest PDF BibTeX XML Cite \textit{N. Robertson} and \textit{P. D. Seymour}, J. Comb. Theory, Ser. B 35, 39--61 (1983; Zbl 0521.05062) Full Text: DOI References: [1] \scN. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, submitted. · Zbl 0611.05017 [2] \scN. Robertson and P. D. Seymour, Graph minors. III. Planar tree-width,J. Combinatorial Theory (Ser. B), to appear. · Zbl 0548.05025 [3] \scN. Robertson and P. D. Seymour, Graph minors. IV. Tree-width and well-quasiordering, submitted. · Zbl 0719.05032 [4] \scN. Robertson and P. D. Seymour, Graph minors. V. Excluding a planar graph, submitted. · Zbl 1023.05040 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.