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

Graph minors. II. Algorithmic aspects of tree-width

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

Computing, Computer Science, Mathematics +14

Ordering by Divisibility in Abstract Algebras

Graham Higman · Proceedings of the London Mathematical Society · 1952 · 1.1K citations

Natural Sciences, Mathematics, Algebra +2

Graph minors. V. Excluding a planar graph

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1986 · 756 citations

Computing, Computer Science, Combinatorics +8

Graph minors. III. Planar tree-width

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1984 · 726 citations

Natural Sciences, Computer Science, Mathematics +12

Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture

Joseph B. Kruskal · Transactions of the American Mathematical Society · 1960 · 455 citations · Full text

Natural Sciences, Mathematics, Discrete Mathematics +5