Paul D. Seymour

Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé: Tournaments and colouring. J. Comb. Theory, Ser. B 103(1): 1-20 (2013)

Felix Brandt, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Sergey Norin, Alex Scott, Paul D. Seymour, Stéphan Thomassé: A counterexample to a conjecture of Schwartz. Social Choice and Welfare 40(3): 739-743 (2013)

Maria Chudnovsky, Andrew D. King, Matthieu Plumettaz, Paul D. Seymour: A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs. SIAM J. Discrete Math. 27(1): 95-108 (2013)

Maria Chudnovsky, Paul D. Seymour: Packing seagulls. Combinatorica 32(3): 251-282 (2012)

Maria Chudnovsky, Sang-il Oum, Paul D. Seymour: Finding minimum clique capacity. Combinatorica 32(3): 283-287 (2012)

Maria Chudnovsky, Paul D. Seymour: Perfect matchings in planar cubic graphs. Combinatorica 32(4): 403-424 (2012)

Maria Chudnovsky, Alexandra Ovetsky Fradkin, Paul D. Seymour: Tournament immersion and cutwidth. J. Comb. Theory, Ser. B 102(1): 93-101 (2012)

Maria Chudnovsky, Paul D. Seymour: Three-colourable perfect graphs without even pairs. J. Comb. Theory, Ser. B 102(2): 363-394 (2012)

Neil Robertson, Paul D. Seymour: Graph Minors. XXII. Irrelevant vertices in linkage problems. J. Comb. Theory, Ser. B 102(2): 530-563 (2012)

Maria Chudnovsky, Paul D. Seymour: Claw-free graphs. VII. Quasi-line graphs. J. Comb. Theory, Ser. B 102(6): 1267-1294 (2012)

Maria Chudnovsky, Paul D. Seymour: Growing Without Cloning. SIAM J. Discrete Math. 26(2): 860-880 (2012)

Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols: Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. IEEE/ACM Trans. Netw. 20(1): 163-176 (2012)

Ilhee Kim, Paul D. Seymour: Tournament Minors. CoRR abs/1206.3135 (2012)

Maria Chudnovsky, Katherine Edwards, Paul D. Seymour: Edge-colouring eight-regular planar graphs. CoRR abs/1209.1176 (2012)

Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour: Edge-colouring seven-regular planar graphs. CoRR abs/1210.7349 (2012)

Maria Chudnovsky, Bruce A. Reed, Paul D. Seymour: The edge-density for K_{2, t} minors. J. Comb. Theory, Ser. B 101(1): 18-46 (2011)

Maria Chudnovsky, Paul D. Seymour: A well-quasi-order for tournaments. J. Comb. Theory, Ser. B 101(1): 47-53 (2011)

Maria Chudnovsky, Andrew D. King, Matthieu Plumettaz, Paul D. Seymour: A local strengthening of Reed's ω, Δ, χ conjecture for quasi-line graphs. CoRR abs/1109.2112 (2011)

Maria Chudnovsky, Paul D. Seymour: The three-in-a-tree problem. Combinatorica 30(4): 387-417 (2010)

Paul D. Seymour, Blair Sullivan: Counting paths in digraphs. Eur. J. Comb. 31(3): 961-975 (2010)

Neil Robertson, Paul D. Seymour: Graph minors XXIII. Nash-Williams' immersion conjecture. J. Comb. Theory, Ser. B 100(2): 181-205 (2010)

Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas: K₄-free graphs with no odd holes. J. Comb. Theory, Ser. B 100(3): 313-331 (2010)

Maria Chudnovsky, Paul D. Seymour: Claw-free graphs VI. Colouring. J. Comb. Theory, Ser. B 100(6): 560-572 (2010)

Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols: Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. INFOCOM 2010: 2213-2221

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)

Maria Chudnovsky, Paul D. Seymour: Even pairs in Berge graphs. J. Comb. Theory, Ser. B 99(2): 370-377 (2009)

Neil Robertson, Paul D. Seymour: Graph minors. XXI. Graphs with unique linkages. J. Comb. Theory, Ser. B 99(3): 583-616 (2009)

Maria Chudnovsky, Paul D. Seymour, Blair Sullivan: Cycles in dense digraphs. Combinatorica 28(1): 1-18 (2008)

Maria Chudnovsky, Paul D. Seymour: Solution of three problems of Cornuéjols. J. Comb. Theory, Ser. B 98(1): 116-135 (2008)

Maria Chudnovsky, Paul D. Seymour: Claw-free graphs. II. Non-orientable prismatic graphs. J. Comb. Theory, Ser. B 98(2): 249-290 (2008)

Maria Chudnovsky, Paul D. Seymour: Claw-free graphs. III. Circular interval graphs. J. Comb. Theory, Ser. B 98(4): 812-834 (2008)

Maria Chudnovsky, Paul D. Seymour: Claw-free graphs. IV. Decomposition theorem. J. Comb. Theory, Ser. B 98(5): 839-938 (2008)

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)

Maria Chudnovsky, Paul D. Seymour: Claw-free graphs. V. Global structure. J. Comb. Theory, Ser. B 98(6): 1373-1410 (2008)

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)

Sang-il Oum, Paul D. Seymour: Testing branch-width. J. Comb. Theory, Ser. B 97(3): 385-393 (2007)

Maria Chudnovsky, Paul D. Seymour: Claw-free graphs. I. Orientable prismatic graphs. J. Comb. Theory, Ser. B 97(6): 867-903 (2007)

Maria Chudnovsky, Paul D. Seymour: Testing for a theta. SODA 2007: 595-598

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)

Alexander Schrijver, Paul D. Seymour: Solution of two fractional packing problems of Lovász. Discrete Mathematics 306(10-11): 973-978 (2006)

Paul D. Seymour: Disjoint paths in graphs. Discrete Mathematics 306(10-11): 979-991 (2006)

Sang-il Oum, Paul D. Seymour: Approximating clique-width and branch-width. J. Comb. Theory, Ser. B 96(4): 514-528 (2006)

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)

Sang-il Oum, Paul D. Seymour: Certifying large branch-width. SODA 2006: 810-813

Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic: Recognizing Berge Graphs. Combinatorica 25(2): 143-186 (2005)

Maria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour: Detecting even holes. Journal of Graph Theory 48(2): 85-111 (2005)

Maria Chudnovsky, Paul D. Seymour: The structure of claw-free graphs. Surveys in Combinatorics 2005: 153-171

Bruce A. Reed, Paul D. Seymour: Hadwiger's conjecture for line graphs. Eur. J. Comb. 25(6): 873-876 (2004)

Neil Robertson, Paul D. Seymour: Graph Minors. XIX. Well-quasi-ordering on a surface. J. Comb. Theory, Ser. B 90(2): 325-385 (2004)

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)

Neil Robertson, Paul D. Seymour: Graph Minors. XX. Wagner's conjecture. J. Comb. Theory, Ser. B 92(2): 325-357 (2004)

William Cook, Paul D. Seymour: Tour Merging via Branch-Decomposition. INFORMS Journal on Computing 15(3): 233-248 (2003)

Matt DeVos, Paul D. Seymour: Extending partial 3-colourings in a planar graph. J. Comb. Theory, Ser. B 88(2): 219-225 (2003)

Neil Robertson, Paul D. Seymour: Graph Minors. XVI. Excluding a non-planar graph. J. Comb. Theory, Ser. B 89(1): 43-76 (2003)

Neil Robertson, Paul D. Seymour: Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. J. Comb. Theory, Ser. B 89(1): 77-108 (2003)

Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas: Progress on perfect graphs. Math. Program. 97(1-2): 405-422 (2003)

Joan P. Hutchinson, R. Bruce Richter, Paul D. Seymour: Colouring Eulerian Triangulations. J. Comb. Theory, Ser. B 84(2): 225-239 (2002)

Bojan Mohar, Paul D. Seymour: Coloring Locally Bipartite Graphs on Surfaces. J. Comb. Theory, Ser. B 84(2): 301-310 (2002)

Tamra Carpenter, Martin I. Eiger, David Shallcross, Paul D. Seymour: Node Placement and Sizing for Copper Broadband Access Networks. Annals OR 106(1-4): 199-228 (2001)

Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas: Directed Tree-Width. J. Comb. Theory, Ser. B 82(1): 138-154 (2001)

Guoli Ding, Thor Johnson, Paul D. Seymour: Spanning trees with many leaves. Journal of Graph Theory 37(4): 189-197 (2001)

Noga Alon, Michael Krivelevich, Paul D. Seymour: Long cycles in critical graphs. Journal of Graph Theory 35(3): 193-196 (2000)

Neil Robertson, Paul D. Seymour: Graph Minors: XVII. Taming a Vortex. J. Comb. Theory, Ser. B 77(1): 162-210 (1999)

Paul D. Seymour, Klaus Truemper: A Petersen on a Pentagon. J. Comb. Theory, Ser. B 72(1): 63-79 (1998)

Paul D. Seymour: A Note on List Arboricity. J. Comb. Theory, Ser. B 72(1): 150-151 (1998)

Bruce A. Reed, Paul D. Seymour: Fractional Colouring and Hadwiger's Conjecture. J. Comb. Theory, Ser. B 74(2): 147-152 (1998)

Alexander Schrijver, Paul D. Seymour, Peter Winkler: The Ring Loading Problem. SIAM J. Discrete Math. 11(1): 1-14 (1998)

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

Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas: The Four-Colour Theorem. J. Comb. Theory, Ser. B 70(1): 2-44 (1997)

Neil Robertson, Paul D. Seymour, Robin Thomas: Tutte's Edge-Colouring Conjecture. J. Comb. Theory, Ser. B 70(1): 166-183 (1997)

Paul D. Seymour: Two Chromatic Polynomial Conjectures. J. Comb. Theory, Ser. B 70(1): 184-196 (1997)

William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas: Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). STOC 1997: 402-405

Paul D. Seymour: Packing Circuits in Eulerian Digraphs. Combinatorica 16(2): 223-231 (1996)

Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas: Packing Directed Circuits. Combinatorica 16(4): 535-554 (1996)

Neil Robertson, Paul D. Seymour: Graph Minors: XV. Giant Steps. J. Comb. Theory, Ser. B 68(1): 112-148 (1996)

Zhicheng Gao, R. Bruce Richter, Paul D. Seymour: Irreducible Triangulations of Surfaces. J. Comb. Theory, Ser. B 68(2): 206-217 (1996)

Paul D. Seymour, Robin Thomas: Uniqueness of highly representative surface embeddings. Journal of Graph Theory 23(4): 337-349 (1996)

Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas: Efficiently Four-Coloring Planar Graphs. STOC 1996: 571-575

Paul D. Seymour: Packing Directed Circuits Fractionally. Combinatorica 15(2): 281-288 (1995)

Neil Robertson, Paul D. Seymour: Graph Minors .XIII. The Disjoint Paths Problem. J. Comb. Theory, Ser. B 63(1): 65-110 (1995)

Neil Robertson, Paul D. Seymour, Robin Thomas: Kuratowski Chains. J. Comb. Theory, Ser. B 64(2): 127-154 (1995)

Neil Robertson, Paul D. Seymour, Robin Thomas: Petersen Family Minors. J. Comb. Theory, Ser. B 64(2): 155-184 (1995)

Neil Robertson, Paul D. Seymour, Robin Thomas: Sachs' Linkless Embedding Conjecture. J. Comb. Theory, Ser. B 64(2): 185-227 (1995)

Neil Robertson, Paul D. Seymour: Graph Minors .XII. Distance on a Surface. J. Comb. Theory, Ser. B 64(2): 240-272 (1995)

Neil Robertson, Paul D. Seymour: Graph Miners .XIV. Extending an Embedding. J. Comb. Theory, Ser. B 65(1): 23-50 (1995)

Guoli Ding, Paul D. Seymour, Peter Winkler: Bounding the Vertex Cover Number of a Hypergraph. Combinatorica 14(1): 23-34 (1994)

Paul D. Seymour, Robin Thomas: Call Routing and the Ratcatcher. Combinatorica 14(2): 217-241 (1994)

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)

Neil Robertson, Paul D. Seymour: Graph Minors. XI. Circuits on a Surface. J. Comb. Theory, Ser. B 60(1): 72-106 (1994)

Paul D. Seymour: A Note on Hyperplane Generation. J. Comb. Theory, Ser. B 61(1): 88-91 (1994)

Alexander Schrijver, Paul D. Seymour: Packing Odd Paths. J. Comb. Theory, Ser. B 62(2): 280-288 (1994)

Neil Robertson, Paul D. Seymour, Robin Thomas: Quickly Excluding a Planar Graph. J. Comb. Theory, Ser. B 62(2): 323-348 (1994)

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)

Noga Alon, Paul D. Seymour, Robin Thomas: Planar Separators. SIAM J. Discrete Math. 7(2): 184-193 (1994)

Zoltán Füredi, Jeff Kahn, Paul D. Seymour: On the fractional matching polytope of a hypergraph. Combinatorica 13(2): 167-180 (1993)

Neil Robertson, Paul D. Seymour, Robin Thomas: Hadwiger's conjecture for K ₆-free graphs. Combinatorica 13(3): 279-361 (1993)

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)

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)

Neil Robertson, Paul D. Seymour (Eds.): 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. Contemporary Mathematics 147, American Mathematical Society 1993, isbn 0-8218-5160-8

Jeff Kahn, Paul D. Seymour: A fractional version of the Erdös-Faber-Lovász conjecture. Combinatorica 12(2): 155-160 (1992)

Maurits de Graaf, Alexander Schrijver, Paul D. Seymour: Directed triangles in directed graphs. Discrete Mathematics 110(1-3): 279-282 (1992)

Paul D. Seymour: On secret-sharing matroids. J. Comb. Theory, Ser. B 56(1): 69-73 (1992)

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)

Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis: The Complexity of Multiway Cuts (Extended Abstract). STOC 1992: 241-251

Paul D. Seymour: Directed circuits on a torus. Combinatorica 11(3): 261-273 (1991)

Neil Robertson, Paul D. Seymour, Robin Thomas: Excluding infinite minors. Discrete Mathematics 95(1-3): 303-319 (1991)

Paul D. Seymour, Robin Thomas: An end-faithful spanning tree counterexample. Discrete Mathematics 95(1-3): 321-330 (1991)

Daniel Bienstock, Paul D. Seymour: Monotonicity in Graph Searching. J. Algorithms 12(2): 239-245 (1991)

Neil Robertson, Paul D. Seymour: Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory, Ser. B 52(2): 153-190 (1991)

Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas: Quickly excluding a forest. J. Comb. Theory, Ser. B 52(2): 274-283 (1991)

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)

Neil Robertson, Paul D. Seymour, Robin Thomas: A survey of linkless embeddings. Graph Structure Theory 1991: 125-136

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

Neil Robertson, Paul D. Seymour, Robin Thomas: Structural descriptions of lower ideals of trees. Graph Structure Theory 1991: 525-538

Neil Robertson, Paul D. Seymour: Excluding a graph with one crossing. Graph Structure Theory 1991: 669-676

Paul D. Seymour: Colouring series-parallel graphs. Combinatorica 10(4): 379-392 (1990)

Neil Robertson, Paul D. Seymour: Graph minors. IV. Tree-width and well-quasi-ordering. J. Comb. Theory, Ser. B 48(2): 227-254 (1990)

Neil Robertson, Paul D. Seymour: Graph minors. VIII. A kuratowski theorem for general surfaces. J. Comb. Theory, Ser. B 48(2): 255-288 (1990)

Neil Robertson, Paul D. Seymour: Graph minors. IX. Disjoint crossed paths. J. Comb. Theory, Ser. B 49(1): 40-77 (1990)

Odile Marcotte, Paul D. Seymour: Extending an edge-coloring. Journal of Graph Theory 14(5): 565-573 (1990)

Noga Alon, Paul D. Seymour, Robin Thomas: A Separator Theorem for Graphs with an Excluded Minor and its Applications. STOC 1990: 293-299

Fan R. K. Chung, Paul D. Seymour: Graphs with small bandwidth and cutwidth. Discrete Mathematics 75(1-3): 113-119 (1989)

Noga Alon, Paul D. Seymour: A counterexample to the rank-coloring conjecture. Journal of Graph Theory 13(4): 523-525 (1989)

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)

Paul D. Seymour: On the connectivity function of a matroid. J. Comb. Theory, Ser. B 45(1): 25-30 (1988)

Neil Robertson, Paul D. Seymour: Graph minors. VII. Disjoint paths on a surface. J. Comb. Theory, Ser. B 45(2): 212-254 (1988)

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)

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)

Noga Alon, Jeff Kahn, Paul D. Seymour: Large induced degenerate subgraphs. Graphs and Combinatorics 3(1): 203-211 (1987)

Paul D. Seymour, Carsten Thomassen: Characterization of even directed graphs. J. Comb. Theory, Ser. B 42(1): 36-45 (1987)

Neil Robertson, Paul D. Seymour: Graph Minors. II. Algorithmic Aspects of Tree-Width. J. Algorithms 7(3): 309-322 (1986)

Neil Robertson, Paul D. Seymour: Graph minors. V. Excluding a planar graph. J. Comb. Theory, Ser. B 41(1): 92-114 (1986)

Neil Robertson, Paul D. Seymour: Graph minors. VI. Disjoint paths across a disc. J. Comb. Theory, Ser. B 41(1): 115-138 (1986)

D. J. Hajela, Paul D. Seymour: Counting points in hypercubes and convolution measure algebras. Combinatorica 5(3): 205-214 (1985)

Fan R. K. Chung, D. J. Hajela, Paul D. Seymour: Self-Organizing Sequential Search and Hilbert's Inequalities. STOC 1985: 217-223

Neil Robertson, Paul D. Seymour: Graph minors. III. Planar tree-width. J. Comb. Theory, Ser. B 36(1): 49-64 (1984)

Takao Asano, Takao Nishizeki, Paul D. Seymour: A note on nongraphic matroids. J. Comb. Theory, Ser. B 37(3): 290-293 (1984)

Neil Robertson, Paul D. Seymour: Graph minors. I. Excluding a forest. J. Comb. Theory, Ser. B 35(1): 39-61 (1983)

Paul D. Seymour: Packing nearly-disjoint sets. Combinatorica 2(1): 91-97 (1982)

Paul D. Seymour: Reconizing graphic matroids. Combinatorica 1(1): 75-78 (1981)

Paul D. Seymour: On minors of non-binary matroids. Combinatorica 1(4): 387-394 (1981)

Paul D. Seymour: Nowhere-zero 6-flows. J. Comb. Theory, Ser. B 30(2): 130-135 (1981)

Paul D. Seymour: Even circuits in planar graphs. J. Comb. Theory, Ser. B 31(3): 327-338 (1981)

Paul D. Seymour: Packing and covering with matroid circuits. J. Comb. Theory, Ser. B 28(2): 237-242 (1980)

Paul D. Seymour: Decomposition of regular matroids. J. Comb. Theory, Ser. B 28(3): 305-359 (1980)

Paul D. Seymour: Four-terminus flows. Networks 10(1): 79-86 (1980)

Paul D. Seymour: Matroid representation over GF(3). J. Comb. Theory, Ser. B 26(2): 159-173 (1979)

Paul D. Seymour: A short proof of the two-commodity flow theorem. J. Comb. Theory, Ser. B 26(3): 370-371 (1979)

Paul D. Seymour: A note on the production of matroid minors. J. Comb. Theory, Ser. B 22(3): 289-295 (1977)

Paul D. Seymour: The matroids with the max-flow min-cut property. J. Comb. Theory, Ser. B 23(2-3): 189-222 (1977)