K
v
ire
.com
←
Back
Night
Docs
Library
Review
…
Author
Paul Seymour
also known as P D Seymour, P SEYMOUR, P Seymour
Rutgers, The State University of New Jersey · Society of Actuaries · Georgia Institute of Technology · Hudson Institute
About this author
Works
460
Cited by
25,303
h-index
70
i10
220
ORCID ↗
Top papers
Graph minors. II. Algorithmic aspects of tree-width
Neil Robertson, Paul Seymour
·
1986
·
Journal of Algorithms
↗ 1,543
The strong perfect graph theorem
Maria Chudnovsky, Neil Robertson, Paul Seymour, et al.
·
2006
·
Annals of Mathematics
↗ 1,288
OA
Graph Minors .XIII. The Disjoint Paths Problem
Neil Robertson, Paul Seymour
·
1995
·
Journal of Combinatorial Theory Series B
↗ 1,281
Graph Minors. XX. Wagner's conjecture
Neil Robertson, Paul Seymour
·
2004
·
Journal of Combinatorial Theory Series B
↗ 815
Graph minors. V. Excluding a planar graph
Neil Robertson, Paul Seymour
·
1986
·
Journal of Combinatorial Theory Series B
↗ 755
Decomposition of regular matroids
Paul Seymour
·
1980
·
Journal of Combinatorial Theory Series B
↗ 745
Graph minors. III. Planar tree-width
Neil Robertson, Paul Seymour
·
1984
·
Journal of Combinatorial Theory Series B
↗ 722
Graph minors. X. Obstructions to tree-decomposition
Neil Robertson, Paul Seymour
·
1991
·
Journal of Combinatorial Theory Series B
↗ 665
The Complexity of Multiterminal Cuts
Elias Dahlhaus, D. S. Johnson, Christos H. Papadimitriou, et al.
·
1994
·
SIAM Journal on Computing
↗ 661
The Four-Colour Theorem
Neil Robertson, Daniel P. Sanders, Paul Seymour, et al.
·
1997
·
Journal of Combinatorial Theory Series B
↗ 606
Graph minors. I. Excluding a forest
Neil Robertson, Paul Seymour
·
1983
·
Journal of Combinatorial Theory Series B
↗ 584
Approximating clique-width and branch-width
Sang‐il Oum, Paul Seymour
·
2006
·
Journal of Combinatorial Theory Series B
↗ 500