| Graph minors. II. Algorithmic aspects of tree-width N Robertson, PD Seymour Journal of algorithms 7 (3), 309-322, 1986 | 3257* | 1986 |
| Combinatorial optimization: papers from the DIMACS Special Year W Cook, L Lovász, PD Seymour American Mathematical Soc., 1995 | 1923 | 1995 |
| Graph minors. XIII. The disjoint paths problem N Robertson, PD Seymour Journal of combinatorial theory, Series B 63 (1), 65-110, 1995 | 1895 | 1995 |
| The strong perfect graph theorem M Chudnovsky, N Robertson, P Seymour, R Thomas Annals of mathematics, 51-229, 2006 | 1721 | 2006 |
| Graph minors. XX. Wagner's conjecture N Robertson, PD Seymour Journal of Combinatorial Theory, Series B 92 (2), 325-357, 2004 | 1286 | 2004 |
| Graph minors. III. Planar tree-width N Robertson, PD Seymour Journal of Combinatorial Theory, Series B 36 (1), 49-64, 1984 | 1103 | 1984 |
| The four-colour theorem N Robertson, D Sanders, P Seymour, R Thomas journal of combinatorial theory, Series B 70 (1), 2-44, 1997 | 1095 | 1997 |
| Graph minors. X. Obstructions to tree-decomposition N Robertson, PD Seymour Journal of Combinatorial Theory, Series B 52 (2), 153-190, 1991 | 1006 | 1991 |
| Decomposition of regular matroids PD Seymour Journal of combinatorial theory, Series B 28 (3), 305-359, 1980 | 948 | 1980 |
| The complexity of multiterminal cuts E Dahlhaus, DS Johnson, CH Papadimitriou, PD Seymour, M Yannakakis SIAM Journal on Computing 23 (4), 864-894, 1994 | 905 | 1994 |
| Graph minors. I. Excluding a forest N Robertson, PD Seymour Journal of Combinatorial Theory, Series B 35 (1), 39-61, 1983 | 894 | 1983 |
| Graph searching and a min-max theorem for tree-width PD Seymour, R Thomas Journal of Combinatorial Theory, Series B 58 (1), 22-33, 1993 | 615 | 1993 |
| Approximating clique-width and branch-width S Oum, P Seymour Journal of Combinatorial Theory, Series B 96 (4), 514-528, 2006 | 604 | 2006 |
| Quickly excluding a planar graph N Robertson, P Seymour, R Thomas Journal of Combinatorial Theory, Series B 62 (2), 323-348, 1994 | 547 | 1994 |
| Call routing and the ratcatcher PD Seymour, R Thomas Combinatorica 14, 217-241, 1994 | 463 | 1994 |
| Graph minors. XVI. Excluding a non-planar graph N Robertson, PD Seymour Journal of Combinatorial Theory, Series B 89 (1), 43-76, 2003 | 462 | 2003 |
| Recognizing berge graphs M Chudnovsky*, G Cornuéjols**, X Liu, P Seymour, K Vušković Combinatorica 25 (2), 143-186, 2005 | 434 | 2005 |
| Multicommodity flows in planar graphs H Okamura, PD Seymour Journal of Combinatorial Theory, Series B 31 (1), 75-81, 1981 | 409 | 1981 |
| Directed tree-width T Johnson, N Robertson, PD Seymour, R Thomas Journal of Combinatorial Theory, Series B 82 (1), 138-154, 2001 | 401 | 2001 |
| Hadwiger's conjecture forK6-free graphs N Robertson, P Seymour, R Thomas Combinatorica 13 (3), 279-361, 1993 | 400 | 1993 |
