Tree-width, path-width, and cutwidth

Graph minors. II. Algorithmic aspects of tree-width

Neil Robertson, Paul Seymour · Journal of Algorithms · 1986 · 1.5K citations

Computing, Computer Science, Mathematics +14

Complexity of Finding Embeddings in a <i>k</i>-Tree

Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski · SIAM Journal on Algebraic and Discrete Methods · 1987 · 1.2K citations

Computing, Computer Science, Mathematics +15

Graph minors. I. Excluding a forest

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1983 · 587 citations

Natural Sciences, Forestry, Graph Visualization +5

On the complexity of finding iso- and other morphisms for partial k-trees

Robin Thomas · Discrete Mathematics · 1992 · 170 citations

Computing, Computer Science, Algorithms +4

Graph minors. IV. Tree-width and well-quasi-ordering

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1990 · 148 citations

Computing, Computer Science, Mathematics +9