 | 2009 |
|---|
| 117 |       | Jim Geelen,
Bert Gerards,
Bruce A. Reed,
Paul D. Seymour,
Adrian Vetta:
On the odd-minor variant of Hadwiger's conjecture.
J. Comb. Theory, Ser. B 99(1): 20-29 (2009) |
| 116 | | Maria Chudnovsky,
Paul D. Seymour:
Even pairs in Berge graphs.
J. Comb. Theory, Ser. B 99(2): 370-377 (2009) |
| 2008 |
|---|
| 115 | | Maria Chudnovsky,
Paul D. Seymour,
Blair Sullivan:
Cycles in dense digraphs.
Combinatorica 28(1): 1-18 (2008) |
| 114 | | Maria Chudnovsky,
Paul D. Seymour:
Solution of three problems of Cornuéjols.
J. Comb. Theory, Ser. B 98(1): 116-135 (2008) |
| 113 | | Maria Chudnovsky,
Paul D. Seymour:
Claw-free graphs. II. Non-orientable prismatic graphs.
J. Comb. Theory, Ser. B 98(2): 249-290 (2008) |
| 112 | | Maria Chudnovsky,
Paul D. Seymour:
Claw-free graphs. III. Circular interval graphs.
J. Comb. Theory, Ser. B 98(4): 812-834 (2008) |
| 111 | | Maria Chudnovsky,
Paul D. Seymour:
Claw-free graphs. IV. Decomposition theorem.
J. Comb. Theory, Ser. B 98(5): 839-938 (2008) |
| 110 | | Louigi Addario-Berry,
Maria Chudnovsky,
Frédéric Havet,
Bruce A. Reed,
Paul D. Seymour:
Bisimplicial vertices in even-hole-free graphs.
J. Comb. Theory, Ser. B 98(6): 1119-1164 (2008) |
| 109 | | Maria Chudnovsky,
Paul D. Seymour:
Claw-free graphs. V. Global structure.
J. Comb. Theory, Ser. B 98(6): 1373-1410 (2008) |
| 2007 |
|---|
| 108 | | Maria Chudnovsky,
Paul D. Seymour:
Testing for a theta.
SODA 2007: 595-598 |
| 107 | | Maria Chudnovsky,
Paul D. Seymour:
The roots of the independence polynomial of a clawfree graph.
J. Comb. Theory, Ser. B 97(3): 350-357 (2007) |
| 106 | | Sang-il Oum,
Paul D. Seymour:
Testing branch-width.
J. Comb. Theory, Ser. B 97(3): 385-393 (2007) |
| 105 | | Maria Chudnovsky,
Paul D. Seymour:
Claw-free graphs. I. Orientable prismatic graphs.
J. Comb. Theory, Ser. B 97(6): 867-903 (2007) |
| 2006 |
|---|
| 104 | | Sang-il Oum,
Paul D. Seymour:
Certifying large branch-width.
SODA 2006: 810-813 |
| 103 | | Maria Chudnovsky,
Jim Geelen,
Bert Gerards,
Luis A. Goddyn,
Michael Lohman,
Paul D. Seymour:
Packing Non-Zero A-Paths In Group-Labelled Graphs.
Combinatorica 26(5): 521-532 (2006) |
| 102 | | Alexander Schrijver,
Paul D. Seymour:
Solution of two fractional packing problems of Lovász.
Discrete Mathematics 306(10-11): 973-978 (2006) |
| 101 | | Paul D. Seymour:
Disjoint paths in graphs.
Discrete Mathematics 306(10-11): 979-991 (2006) |
| 100 | | Sang-il Oum,
Paul D. Seymour:
Approximating clique-width and branch-width.
J. Comb. Theory, Ser. B 96(4): 514-528 (2006) |
| 99 | | Serguei Norine,
Paul D. Seymour,
Robin Thomas,
Paul Wollan:
Proper minor-closed families are small.
J. Comb. Theory, Ser. B 96(5): 754-757 (2006) |
| 2005 |
|---|
| 98 |  | Maria Chudnovsky,
Paul D. Seymour:
The structure of claw-free graphs.
Surveys in Combinatorics 2005: 153-171 |
| 97 | | Maria Chudnovsky,
Gérard Cornuéjols,
Xinming Liu,
Paul D. Seymour,
Kristina Vuskovic:
Recognizing Berge Graphs.
Combinatorica 25(2): 143-186 (2005) |
| 96 | | Maria Chudnovsky,
Ken-ichi Kawarabayashi,
Paul D. Seymour:
Detecting even holes.
Journal of Graph Theory 48(2): 85-111 (2005) |
| 2004 |
|---|
| 95 | | Bruce A. Reed,
Paul D. Seymour:
Hadwiger's conjecture for line graphs.
Eur. J. Comb. 25(6): 873-876 (2004) |
| 94 | | Neil Robertson,
Paul D. Seymour:
Graph Minors. XIX. Well-quasi-ordering on a surface.
J. Comb. Theory, Ser. B 90(2): 325-385 (2004) |
| 93 | | Matt DeVos,
Guoli Ding,
Bogdan Oporowski,
Daniel P. Sanders,
Bruce A. Reed,
Paul D. Seymour,
Dirk Vertigan:
Excluding any graph as a minor allows a low tree-width 2-coloring.
J. Comb. Theory, Ser. B 91(1): 25-41 (2004) |
| 92 | | Neil Robertson,
Paul D. Seymour:
Graph Minors. XX. Wagner's conjecture.
J. Comb. Theory, Ser. B 92(2): 325-357 (2004) |
| 2003 |
|---|
| 91 | | William Cook,
Paul D. Seymour:
Tour Merging via Branch-Decomposition.
INFORMS Journal on Computing 15(3): 233-248 (2003) |
| 90 | | Matt DeVos,
Paul D. Seymour:
Extending partial 3-colourings in a planar graph.
J. Comb. Theory, Ser. B 88(2): 219-225 (2003) |
| 89 | | Neil Robertson,
Paul D. Seymour:
Graph Minors. XVI. Excluding a non-planar graph.
J. Comb. Theory, Ser. B 89(1): 43-76 (2003) |
| 88 | | Neil Robertson,
Paul D. Seymour:
Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering.
J. Comb. Theory, Ser. B 89(1): 77-108 (2003) |
| 2002 |
|---|
| 87 | | Joan P. Hutchinson,
R. Bruce Richter,
Paul D. Seymour:
Colouring Eulerian Triangulations.
J. Comb. Theory, Ser. B 84(2): 225-239 (2002) |
| 86 | | Bojan Mohar,
Paul D. Seymour:
Coloring Locally Bipartite Graphs on Surfaces.
J. Comb. Theory, Ser. B 84(2): 301-310 (2002) |
| 2001 |
|---|
| 85 | | Tamra Carpenter,
Martin Eiger,
David Shallcross,
Paul D. Seymour:
Node Placement and Sizing for Copper Broadband Access Networks.
Annals OR 106(1-4): 199-228 (2001) |
| 84 | | Thor Johnson,
Neil Robertson,
Paul D. Seymour,
Robin Thomas:
Directed Tree-Width.
J. Comb. Theory, Ser. B 82(1): 138-154 (2001) |
| 1999 |
|---|
| 83 | | Neil Robertson,
Paul D. Seymour:
Graph Minors: XVII. Taming a Vortex.
J. Comb. Theory, Ser. B 77(1): 162-210 (1999) |
| 1998 |
|---|
| 82 | | Siddhartha R. Dalal,
Ashish Jain,
Gardner C. Patton,
Manish Rathi,
Paul D. Seymour:
AETGSM Web: A Web Based Service for Automatic Efficient Test Generation from Functional Requirements.
WIFT 1998: 84-85 |
| 81 | | Paul D. Seymour:
A Note on List Arboricity.
J. Comb. Theory, Ser. B 72(1): 150-151 (1998) |
| 80 | | Paul D. Seymour,
Klaus Truemper:
A Petersen on a Pentagon.
J. Comb. Theory, Ser. B 72(1): 63-79 (1998) |
| 79 | | Bruce A. Reed,
Paul D. Seymour:
Fractional Colouring and Hadwiger's Conjecture.
J. Comb. Theory, Ser. B 74(2): 147-152 (1998) |
| 78 | | Alexander Schrijver,
Paul D. Seymour,
Peter Winkler:
The Ring Loading Problem.
SIAM J. Discrete Math. 11(1): 1-14 (1998) |
| 1997 |
|---|
| 77 | | William McCuaig,
Neil Robertson,
Paul D. Seymour,
Robin Thomas:
Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract).
STOC 1997: 402-405 |
| 76 | | Neil Robertson,
Paul D. Seymour,
Robin Thomas:
Tutte's Edge-Colouring Conjecture.
J. Comb. Theory, Ser. B 70(1): 166-183 (1997) |
| 75 | | Paul D. Seymour:
Two Chromatic Polynomial Conjectures.
J. Comb. Theory, Ser. B 70(1): 184-196 (1997) |
| 74 | | Neil Robertson,
Daniel P. Sanders,
Paul D. Seymour,
Robin Thomas:
The Four-Colour Theorem.
J. Comb. Theory, Ser. B 70(1): 2-44 (1997) |
| 1996 |
|---|
| 73 | | Neil Robertson,
Daniel P. Sanders,
Paul D. Seymour,
Robin Thomas:
Efficiently Four-Coloring Planar Graphs.
STOC 1996: 571-575 |
| 72 | | Paul D. Seymour:
Packing Circuits in Eulerian Digraphs.
Combinatorica 16(2): 223-231 (1996) |
| 71 | | Bruce A. Reed,
Neil Robertson,
Paul D. Seymour,
Robin Thomas:
Packing Directed Circuits.
Combinatorica 16(4): 535-554 (1996) |
| 70 | | Neil Robertson,
Paul D. Seymour:
Graph Minors: XV. Giant Steps.
J. Comb. Theory, Ser. B 68(1): 112-148 (1996) |
| 69 | | Zhicheng Gao,
R. Bruce Richter,
Paul D. Seymour:
Irreducible Triangulations of Surfaces.
J. Comb. Theory, Ser. B 68(2): 206-217 (1996) |
| 1995 |
|---|
| 68 | | Paul D. Seymour:
Packing Directed Circuits Fractionally.
Combinatorica 15(2): 281-288 (1995) |
| 67 | | Neil Robertson,
Paul D. Seymour:
Graph Minors .XIII. The Disjoint Paths Problem.
J. Comb. Theory, Ser. B 63(1): 65-110 (1995) |
| 66 | | Neil Robertson,
Paul D. Seymour,
Robin Thomas:
Kuratowski Chains.
J. Comb. Theory, Ser. B 64(2): 127-154 (1995) |
| 65 | | Neil Robertson,
Paul D. Seymour,
Robin Thomas:
Petersen Family Minors.
J. Comb. Theory, Ser. B 64(2): 155-184 (1995) |
| 64 | | Neil Robertson,
Paul D. Seymour,
Robin Thomas:
Sachs' Linkless Embedding Conjecture.
J. Comb. Theory, Ser. B 64(2): 185-227 (1995) |
| 63 | | Neil Robertson,
Paul D. Seymour:
Graph Minors .XII. Distance on a Surface.
J. Comb. Theory, Ser. B 64(2): 240-272 (1995) |
| 62 | | Neil Robertson,
Paul D. Seymour:
Graph Miners .XIV. Extending an Embedding.
J. Comb. Theory, Ser. B 65(1): 23-50 (1995) |
| 1994 |
|---|
| 61 | | Guoli Ding,
Paul D. Seymour,
Peter Winkler:
Bounding the Vertex Cover Number of a Hypergraph.
Combinatorica 14(1): 23-34 (1994) |
| 60 | | Paul D. Seymour,
Robin Thomas:
Call Routing and the Ratcatcher.
Combinatorica 14(2): 217-241 (1994) |
| 59 | | R. Bruce Richter,
Paul D. Seymour,
Jozef Sirán:
Circular embeddings of planar graphs in nonspherical surfaces.
Discrete Mathematics 126(1-3): 273-280 (1994) |
| 58 | | Neil Robertson,
Paul D. Seymour:
Graph Minors. XI. Circuits on a Surface.
J. Comb. Theory, Ser. B 60(1): 72-106 (1994) |
| 57 | | Paul D. Seymour:
A Note on Hyperplane Generation.
J. Comb. Theory, Ser. B 61(1): 88-91 (1994) |
| 56 | | Alexander Schrijver,
Paul D. Seymour:
Packing Odd Paths.
J. Comb. Theory, Ser. B 62(2): 280-288 (1994) |
| 55 | | Neil Robertson,
Paul D. Seymour,
Robin Thomas:
Quickly Excluding a Planar Graph.
J. Comb. Theory, Ser. B 62(2): 323-348 (1994) |
| 54 | | Elias Dahlhaus,
David S. Johnson,
Christos H. Papadimitriou,
Paul D. Seymour,
Mihalis Yannakakis:
The Complexity of Multiterminal Cuts.
SIAM J. Comput. 23(4): 864-894 (1994) |
| 53 | | Noga Alon,
Paul D. Seymour,
Robin Thomas:
Planar Separators.
SIAM J. Discrete Math. 7(2): 184-193 (1994) |
| 1993 |
|---|
| 52 | | Neil Robertson,
Paul D. Seymour:
Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle
American Mathematical Society 1993 |
| 51 | | Zoltán Füredi,
Jeff Kahn,
Paul D. Seymour:
On the fractional matching polytope of a hypergraph.
Combinatorica 13(2): 167-180 (1993) |
| 50 | | Neil Robertson,
Paul D. Seymour,
Robin Thomas:
Hadwiger's conjecture for K 6-free graphs.
Combinatorica 13(3): 279-361 (1993) |
| 49 | | Paul D. Seymour,
Robin Thomas:
Graph Searching and a Min-Max Theorem for Tree-Width.
J. Comb. Theory, Ser. B 58(1): 22-33 (1993) |
| 48 | | Guoli Ding,
Alexander Schrijver,
Paul D. Seymour:
Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle.
J. Comb. Theory, Ser. B 58(1): 40-45 (1993) |
| 1992 |
|---|
| 47 | | Elias Dahlhaus,
David S. Johnson,
Christos H. Papadimitriou,
Paul D. Seymour,
Mihalis Yannakakis:
The Complexity of Multiway Cuts (Extended Abstract)
STOC 1992: 241-251 |
| 46 | | Jeff Kahn,
Paul D. Seymour:
A fractional version of the Erdös-Faber-Lovász conjecture.
Combinatorica 12(2): 155-160 (1992) |
| 45 | | Maurits de Graaf,
Alexander Schrijver,
Paul D. Seymour:
Directed triangles in directed graphs.
Discrete Mathematics 110(1-3): 279-282 (1992) |
| 44 | | Paul D. Seymour:
On secret-sharing matroids.
J. Comb. Theory, Ser. B 56(1): 69-73 (1992) |
| 43 | | Guoli Ding,
Alexander Schrijver,
Paul D. Seymour:
Disjoint Paths in a Planar Graph - A General Theorem.
SIAM J. Discrete Math. 5(1): 112-116 (1992) |
| 1991 |
|---|
| 42 | | Neil Robertson,
Paul D. Seymour,
Robin Thomas:
A survey of linkless embeddings.
Graph Structure Theory 1991: 125-136 |
| 41 | | Bruce A. Reed,
Neil Robertson,
Alexander Schrijver,
Paul D. Seymour:
Finding dsjoint trees in planar graphs in linear time.
Graph Structure Theory 1991: 295-302 |
| 40 | | Neil Robertson,
Paul D. Seymour,
Robin Thomas:
Structural descriptions of lower ideals of trees.
Graph Structure Theory 1991: 525-538 |
| 39 | | Neil Robertson,
Paul D. Seymour:
Excluding a graph with one crossing.
Graph Structure Theory 1991: 669-676 |
| 38 | | Paul D. Seymour:
Directed circuits on a torus.
Combinatorica 11(3): 261-273 (1991) |
| 37 | | Neil Robertson,
Paul D. Seymour,
Robin Thomas:
Excluding infinite minors.
Discrete Mathematics 95(1-3): 303-319 (1991) |
| 36 | | Paul D. Seymour,
Robin Thomas:
An end-faithful spanning tree counterexample.
Discrete Mathematics 95(1-3): 321-330 (1991) |
| 35 | | Daniel Bienstock,
Paul D. Seymour:
Monotonicity in Graph Searching.
J. Algorithms 12(2): 239-245 (1991) |
| 34 | | Alexander Schrijver,
Paul D. Seymour:
A simpler proof and a generalization of the zero-trees theorem.
J. Comb. Theory, Ser. A 58(2): 301-305 (1991) |
| 33 | | Neil Robertson,
Paul D. Seymour:
Graph minors. X. Obstructions to tree-decomposition.
J. Comb. Theory, Ser. B 52(2): 153-190 (1991) |
| 32 | | Daniel Bienstock,
Neil Robertson,
Paul D. Seymour,
Robin Thomas:
Quickly excluding a forest.
J. Comb. Theory, Ser. B 52(2): 274-283 (1991) |
| 1990 |
|---|
| 31 | | Noga Alon,
Paul D. Seymour,
Robin Thomas:
A Separator Theorem for Graphs with an Excluded Minor and its Applications
STOC 1990: 293-299 |
| 30 | | Paul D. Seymour:
Colouring series-parallel graphs.
Combinatorica 10(4): 379-392 (1990) |
| 29 | | Neil Robertson,
Paul D. Seymour:
Graph minors. IV. Tree-width and well-quasi-ordering.
J. Comb. Theory, Ser. B 48(2): 227-254 (1990) |
| 28 | | Neil Robertson,
Paul D. Seymour:
Graph minors. VIII. A kuratowski theorem for general surfaces.
J. Comb. Theory, Ser. B 48(2): 255-288 (1990) |
| 27 | | Neil Robertson,
Paul D. Seymour:
Graph minors. IX. Disjoint crossed paths.
J. Comb. Theory, Ser. B 49(1): 40-77 (1990) |
| 1989 |
|---|
| 26 | | Fan R. K. Chung,
Paul D. Seymour:
Graphs with small bandwidth and cutwidth.
Discrete Mathematics 75(1-3): 113-119 (1989) |
| 1988 |
|---|
| 25 | | Fan R. K. Chung,
Zoltán Füredi,
Ronald L. Graham,
Paul D. Seymour:
On induced subgraphs of the cube.
J. Comb. Theory, Ser. A 49(1): 180-187 (1988) |
| 24 | | Paul D. Seymour:
On the connectivity function of a matroid.
J. Comb. Theory, Ser. B 45(1): 25-30 (1988) |
| 23 | | Neil Robertson,
Paul D. Seymour:
Graph minors. VII. Disjoint paths on a surface.
J. Comb. Theory, Ser. B 45(2): 212-254 (1988) |
| 22 | | Fan R. K. Chung,
D. J. Hajela,
Paul D. Seymour:
Self-organizing Sequential Search and Hilbert's Inequalities.
J. Comput. Syst. Sci. 36(2): 148-157 (1988) |
| 1987 |
|---|
| 21 | | Noga Alon,
Daniel J. Kleitman,
Carl Pomerance,
Michael E. Saks,
Paul D. Seymour:
The smallets n-uniform hypergraph with positive discrepancy.
Combinatorica 7(2): 151-160 (1987) |
| 20 | | Paul D. Seymour,
Carsten Thomassen:
Characterization of even directed graphs.
J. Comb. Theory, Ser. B 42(1): 36-45 (1987) |
| 1986 |
|---|
| 19 | | Neil Robertson,
Paul D. Seymour:
Graph Minors. II. Algorithmic Aspects of Tree-Width.
J. Algorithms 7(3): 309-322 (1986) |
| 18 | | Neil Robertson,
Paul D. Seymour:
Graph minors. VI. Disjoint paths across a disc.
J. Comb. Theory, Ser. B 41(1): 115-138 (1986) |
| 17 | | Neil Robertson,
Paul D. Seymour:
Graph minors. V. Excluding a planar graph.
J. Comb. Theory, Ser. B 41(1): 92-114 (1986) |
| 1985 |
|---|
| 16 | | Fan R. K. Chung,
D. J. Hajela,
Paul D. Seymour:
Self-Organizing Sequential Search and Hilbert's Inequalities
STOC 1985: 217-223 |
| 15 | | D. J. Hajela,
Paul D. Seymour:
Counting points in hypercubes and convolution measure algebras.
Combinatorica 5(3): 205-214 (1985) |
| 1984 |
|---|
| 14 | | Neil Robertson,
Paul D. Seymour:
Graph minors. III. Planar tree-width.
J. Comb. Theory, Ser. B 36(1): 49-64 (1984) |
| 13 | | Takao Asano,
Takao Nishizeki,
Paul D. Seymour:
A note on nongraphic matroids.
J. Comb. Theory, Ser. B 37(3): 290-293 (1984) |
| 1983 |
|---|
| 12 | | Neil Robertson,
Paul D. Seymour:
Graph minors. I. Excluding a forest.
J. Comb. Theory, Ser. B 35(1): 39-61 (1983) |
| 1982 |
|---|
| 11 | | Paul D. Seymour:
Packing nearly-disjoint sets.
Combinatorica 2(1): 91-97 (1982) |
| 1981 |
|---|
| 10 | | Paul D. Seymour:
Reconizing graphic matroids.
Combinatorica 1(1): 75-78 (1981) |
| 9 | | Paul D. Seymour:
On minors of non-binary matroids.
Combinatorica 1(4): 387-394 (1981) |
| 8 | | Paul D. Seymour:
Nowhere-zero 6-flows.
J. Comb. Theory, Ser. B 30(2): 130-135 (1981) |
| 7 | | Paul D. Seymour:
Even circuits in planar graphs.
J. Comb. Theory, Ser. B 31(3): 327-338 (1981) |
| 1980 |
|---|
| 6 | | Paul D. Seymour:
Packing and covering with matroid circuits.
J. Comb. Theory, Ser. B 28(2): 237-242 (1980) |
| 5 | | Paul D. Seymour:
Decomposition of regular matroids.
J. Comb. Theory, Ser. B 28(3): 305-359 (1980) |
| 1979 |
|---|
| 4 | | Paul D. Seymour:
Matroid representation over GF(3).
J. Comb. Theory, Ser. B 26(2): 159-173 (1979) |
| 3 | | Paul D. Seymour:
A short proof of the two-commodity flow theorem.
J. Comb. Theory, Ser. B 26(3): 370-371 (1979) |
| 1977 |
|---|
| 2 | | Paul D. Seymour:
A note on the production of matroid minors.
J. Comb. Theory, Ser. B 22(3): 289-295 (1977) |
| 1 | | Paul D. Seymour:
The matroids with the max-flow min-cut property.
J. Comb. Theory, Ser. B 23(2-3): 189-222 (1977) |
