Подписаться
Paul Seymour, P.D. Seymour, Paul D. Seymour
Paul Seymour, P.D. Seymour, Paul D. Seymour
Alfred Baldwin Dod Professor of Mathematics, Princeton University
Нет подтвержденного адреса электронной почты
Название
Процитировано
Процитировано
Год
Graph minors. II. Algorithmic aspects of tree-width
N Robertson, PD Seymour
Journal of algorithms 7 (3), 309-322, 1986
2813*1986
Combinatorial optimization: papers from the DIMACS Special Year
W Cook, L Lovász, PD Seymour
American Mathematical Soc., 1995
17271995
Graph minors. XIII. The disjoint paths problem
N Robertson, PD Seymour
Journal of combinatorial theory, Series B 63 (1), 65-110, 1995
16071995
The strong perfect graph theorem
M Chudnovsky, N Robertson, P Seymour, R Thomas
Annals of mathematics, 51-229, 2006
14652006
Graph minors. XX. Wagner's conjecture
N Robertson, PD Seymour
Journal of Combinatorial Theory, Series B 92 (2), 325-357, 2004
10992004
The four-colour theorem
N Robertson, D Sanders, P Seymour, R Thomas
journal of combinatorial theory, Series B 70 (1), 2-44, 1997
9541997
Graph minors. III. Planar tree-width
N Robertson, PD Seymour
Journal of Combinatorial Theory, Series B 36 (1), 49-64, 1984
9091984
Decomposition of regular matroids
PD Seymour
Journal of combinatorial theory, Series B 28 (3), 305-359, 1980
8721980
Graph minors. X. Obstructions to tree-decomposition
N Robertson, PD Seymour
Journal of Combinatorial Theory, Series B 52 (2), 153-190, 1991
8381991
The complexity of multiterminal cuts
E Dahlhaus, DS Johnson, CH Papadimitriou, PD Seymour, M Yannakakis
SIAM Journal on Computing 23 (4), 864-894, 1994
8251994
Graph minors. I. Excluding a forest
N Robertson, PD Seymour
Journal of Combinatorial Theory, Series B 35 (1), 39-61, 1983
7481983
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
5191993
Approximating clique-width and branch-width
S Oum, P Seymour
Journal of Combinatorial Theory, Series B 96 (4), 514-528, 2006
5172006
Quickly excluding a planar graph
N Robertson, P Seymour, R Thomas
Journal of Combinatorial Theory, Series B 62 (2), 323-348, 1994
4931994
Call routing and the ratcatcher
PD Seymour, R Thomas
Combinatorica 14 (2), 217-241, 1994
4221994
Recognizing berge graphs
M Chudnovsky, G Cornuéjols, X Liu, P Seymour, K Vuskovic
Princeton University Princeton United States, 2004
4082004
Multicommodity flows in planar graphs
H Okamura, PD Seymour
Journal of Combinatorial Theory, Series B 31 (1), 75-81, 1981
3801981
Graph minors. XVI. Excluding a non-planar graph
N Robertson, PD Seymour
Journal of Combinatorial Theory, Series B 89 (1), 43-76, 2003
3752003
Hadwiger's conjecture forK 6-free graphs
N Robertson, P Seymour, R Thomas
Combinatorica 13 (3), 279-361, 1993
3471993
Directed tree-width
T Johnson, N Robertson, PD Seymour, R Thomas
Journal of Combinatorial Theory, Series B 82 (1), 138-154, 2001
3322001
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20