The matroids with the max-flow min-cut property. - Paul D. Seymour (J. Comb. Theory B, 1977)

A note on the production of matroid minors. - Paul D. Seymour (J. Comb. Theory B, 1977)

Counterexample to a conjecture of Jeurissen. - Paul D. Seymour (Discret. Math., 1978)

A two-commodity cut theorem. - Paul D. Seymour (Discret. Math., 1978)

Matroid representation over GF(3). - Paul D. Seymour (J. Comb. Theory B, 1979)

A short proof of the two-commodity flow theorem. - Paul D. Seymour (J. Comb. Theory B, 1979)

Disjoint paths in graphs. - Paul D. Seymour (Discret. Math., 1980)

Packing and covering with matroid circuits. - Paul D. Seymour (J. Comb. Theory B, 1980)

Decomposition of regular matroids. - Paul D. Seymour (J. Comb. Theory B, 1980)

Four-terminus flows. - Paul D. Seymour (Networks, 1980)

Reconizing graphic matroids. - Paul D. Seymour (Comb., 1981)

On minors of non-binary matroids. - Paul D. Seymour (Comb., 1981)

Matroids and Multicommodity Flows. - Paul D. Seymour (Eur. J. Comb., 1981)

Even circuits in planar graphs. - Paul D. Seymour (J. Comb. Theory B, 1981)

Nowhere-zero 6-flows. - Paul D. Seymour (J. Comb. Theory B, 1981)

Multicommodity flows in planar graphs. - Haruko Okamura; Paul D. Seymour (J. Comb. Theory B, 1981)

On Tutte's extension of the four-colour problem. - Paul D. Seymour (J. Comb. Theory B, 1981)

Packing nearly-disjoint sets. - Paul D. Seymour (Comb., 1982)

Graph minors. I. Excluding a forest. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 1983)

A note on nongraphic matroids. - Takao Asano; Takao Nishizeki; Paul D. Seymour (J. Comb. Theory B, 1984)

Graph minors. III. Planar tree-width. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 1984)

A generalization of chordal graphs. - Paul D. Seymour; R. W. Weaver (J. Graph Theory, 1984)

Counting points in hypercubes and convolution measure algebras. - D. J. Hajela; Paul D. Seymour (Comb., 1985)

Minors of 3-Connected Matroids. - Paul D. Seymour (Eur. J. Comb., 1985)

Adjacency in Binary Matroids. - Paul D. Seymour (Eur. J. Comb., 1986)

Triples in Matroid Circuits. - Paul D. Seymour (Eur. J. Comb., 1986)

Graph Minors. II. Algorithmic Aspects of Tree-Width. - Neil Robertson 001; Paul D. Seymour (J. Algorithms, 1986)

Graph minors. V. Excluding a planar graph. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 1986)

Graph minors. VI. Disjoint paths across a disc. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 1986)

The smallets n-uniform hypergraph with positive discrepancy. - Noga Alon; Daniel J. Kleitman; Carl Pomerance; Michael E. Saks; Paul D. Seymour (Comb., 1987)

Large induced degenerate subgraphs. - Noga Alon; Jeff Kahn 001; Paul D. Seymour (Graphs Comb., 1987)

Characterization of even directed graphs. - Paul D. Seymour; Carsten Thomassen (J. Comb. Theory B, 1987)

Subgraphs of large connectivity and chromatic number in graphs of large chromatic number. - Noga Alon; Daniel J. Kleitman; Carsten Thomassen; Michael E. Saks; Paul D. Seymour (J. Graph Theory, 1987)

Self-organizing Sequential Search and Hilbert's Inequalities. - Fan R. K. Chung; D. J. Hajela; Paul D. Seymour (J. Comput. Syst. Sci., 1988)

On induced subgraphs of the cube. - Fan R. K. Chung; Zoltán Füredi; Ronald L. Graham; Paul D. Seymour (J. Comb. Theory A, 1988)

Graph minors. VII. Disjoint paths on a surface. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 1988)

On the connectivity function of a matroid. - Paul D. Seymour (J. Comb. Theory B, 1988)

Graphs with small bandwidth and cutwidth. - Fan R. K. Chung; Paul D. Seymour (Discret. Math., 1989)

A counterexample to the rank-coloring conjecture. - Noga Alon; Paul D. Seymour (J. Graph Theory, 1989)

Spanning Trees of Different Weights. - Alexander Schrijver; Paul D. Seymour (Polyhedral Combinatorics, 1990)

On Lehman's Width-Length Characterization. - Paul D. Seymour (Polyhedral Combinatorics, 1990)

A Separator Theorem for Graphs with an Excluded Minor and its Applications - Noga Alon; Paul D. Seymour; Robin Thomas 001 (STOC, 1990)

Colouring series-parallel graphs. - Paul D. Seymour (Comb., 1990)

Graph minors. IX. Disjoint crossed paths. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 1990)

Graph minors. IV. Tree-width and well-quasi-ordering. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 1990)

Graph minors. VIII. A kuratowski theorem for general surfaces. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 1990)

Extending an edge-coloring. - Odile Marcotte; Paul D. Seymour (J. Graph Theory, 1990)

Finding disjoint trees in planar graphs in linear time. - Bruce A. Reed; Neil Robertson 001; Alexander Schrijver; Paul D. Seymour (Graph Structure Theory, 1991)

Excluding a graph with one crossing. - Neil Robertson 001; Paul D. Seymour (Graph Structure Theory, 1991)

A survey of linkless embeddings. - Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (Graph Structure Theory, 1991)

Structural descriptions of lower ideals of trees. - Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (Graph Structure Theory, 1991)

Directed circuits on a torus. - Paul D. Seymour (Comb., 1991)

Excluding infinite minors. - Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (Discret. Math., 1991)

An end-faithful spanning tree counterexample. - Paul D. Seymour; Robin Thomas 001 (Discret. Math., 1991)

Monotonicity in Graph Searching. - Daniel Bienstock; Paul D. Seymour (J. Algorithms, 1991)

Quickly excluding a forest. - Daniel Bienstock; Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 1991)

Graph minors. X. Obstructions to tree-decomposition. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 1991)

A simpler proof and a generalization of the zero-trees theorem. - Alexander Schrijver; Paul D. Seymour (J. Comb. Theory A, 1991)

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

A fractional version of the Erdös-Faber-Lovász conjecture. - Jeff Kahn 001; Paul D. Seymour (Comb., 1992)

Directed triangles in directed graphs. - Maurits de Graaf; Alexander Schrijver; Paul D. Seymour (Discret. Math., 1992)

On secret-sharing matroids. - Paul D. Seymour (J. Comb. Theory B, 1992)

Disjoint Paths in a Planar Graph - A General Theorem. - Guoli Ding; Alexander Schrijver; Paul D. Seymour (SIAM J. Discret. Math., 1992)

On the fractional matching polytope of a hypergraph. - Zoltán Füredi; Jeff Kahn 001; Paul D. Seymour (Comb., 1993)

Hadwiger's conjecture for K 6-free graphs. - Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (Comb., 1993)

Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle. - Guoli Ding; Alexander Schrijver; Paul D. Seymour (J. Comb. Theory B, 1993)

Graph Searching and a Min-Max Theorem for Tree-Width. - Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 1993)

Bounding the Vertex Cover Number of a Hypergraph. - Guoli Ding; Paul D. Seymour; Peter Winkler 001 (Comb., 1994)

Call Routing and the Ratcatcher. - Paul D. Seymour; Robin Thomas 001 (Comb., 1994)

Circular embeddings of planar graphs in nonspherical surfaces. - R. Bruce Richter; Paul D. Seymour; Jozef Sirán (Discret. Math., 1994)

Graph Minors. XI. Circuits on a Surface. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 1994)

Quickly Excluding a Planar Graph. - Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 1994)

Packing Odd Paths. - Alexander Schrijver; Paul D. Seymour (J. Comb. Theory B, 1994)

A Note on Hyperplane Generation. - Paul D. Seymour (J. Comb. Theory B, 1994)

The Complexity of Multiterminal Cuts. - Elias Dahlhaus; David S. Johnson 001; Christos H. Papadimitriou; Paul D. Seymour; Mihalis Yannakakis (SIAM J. Comput., 1994)

Planar Separators. - Noga Alon; Paul D. Seymour; Robin Thomas 001 (SIAM J. Discret. Math., 1994)

Packing Directed Circuits Fractionally. - Paul D. Seymour (Comb., 1995)

Graph Minors .XIV. Extending an Embedding. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 1995)

Graph Minors .XII. Distance on a Surface. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 1995)

Graph Minors .XIII. The Disjoint Paths Problem. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 1995)

Kuratowski Chains. - Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 1995)

Petersen Family Minors. - Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 1995)

Sachs' Linkless Embedding Conjecture. - Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 1995)

Efficiently Four-Coloring Planar Graphs. - Neil Robertson 001; Daniel P. Sanders 001; Paul D. Seymour; Robin Thomas 001 (STOC, 1996)

Packing Directed Circuits. - Bruce A. Reed; Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (Comb., 1996)

Packing Circuits in Eulerian Digraphs. - Paul D. Seymour (Comb., 1996)

Irreducible Triangulations of Surfaces. - Zhicheng Gao; R. Bruce Richter; Paul D. Seymour (J. Comb. Theory, Ser. B, 1996)

Graph Minors: XV. Giant Steps. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory, Ser. B, 1996)

Uniqueness of highly representative surface embeddings. - Paul D. Seymour; Robin Thomas 001 (J. Graph Theory, 1996)

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

The Four-Colour Theorem. - Neil Robertson 001; Daniel P. Sanders 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 1997)

Tutte's Edge-Colouring Conjecture. - Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 1997)

Two Chromatic Polynomial Conjectures. - Paul D. Seymour (J. Comb. Theory B, 1997)

AETGSM Web: A Web Based Service for Automatic Efficient Test Generation from Functional Requirements. - Siddhartha R. Dalal; Ashish Jain; Gardner C. Patton; Manish Rathi; Paul D. Seymour (WIFT, 1998)

Fractional Colouring and Hadwiger's Conjecture. - Bruce A. Reed; Paul D. Seymour (J. Comb. Theory B, 1998)

A Note on List Arboricity. - Paul D. Seymour (J. Comb. Theory B, 1998)

A Petersen on a Pentagon. - Paul D. Seymour; Klaus Truemper (J. Comb. Theory B, 1998)

Graph Minors: XVII. Taming a Vortex. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 1999)

The Ring Loading Problem. - Alexander Schrijver; Paul D. Seymour; Peter Winkler 001 (SIAM Rev., 1999)

Long cycles in critical graphs. - Noga Alon; Michael Krivelevich; Paul D. Seymour (J. Graph Theory, 2000)

Node Placement and Sizing for Copper Broadband Access Networks. - Tamra Carpenter; Martin I. Eiger; David Shallcross; Paul D. Seymour (Ann. Oper. Res., 2001)

Directed Tree-Width. - Thor Johnson; Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 2001)

Spanning trees with many leaves. - Guoli Ding; Thor Johnson; Paul D. Seymour (J. Graph Theory, 2001)

Colouring Eulerian Triangulations. - Joan P. Hutchinson; R. Bruce Richter; Paul D. Seymour (J. Comb. Theory B, 2002)

Coloring Locally Bipartite Graphs on Surfaces. - Bojan Mohar; Paul D. Seymour (J. Comb. Theory B, 2002)

Tour Merging via Branch-Decomposition. - William J. Cook; Paul D. Seymour (INFORMS J. Comput., 2003)

Extending partial 3-colourings in a planar graph. - Matt DeVos; Paul D. Seymour (J. Comb. Theory B, 2003)

Graph Minors. XVI. Excluding a non-planar graph. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 2003)

Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 2003)

Progress on perfect graphs. - Maria Chudnovsky; Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (Math. Program., 2003)

Hadwiger's conjecture for line graphs. - Bruce A. Reed; Paul D. Seymour (Eur. J. Comb., 2004)

Excluding any graph as a minor allows a low tree-width 2-coloring. - Matt DeVos; Guoli Ding; Bogdan Oporowski; Daniel P. Sanders 001; Bruce A. Reed; Paul D. Seymour; Dirk Vertigan (J. Comb. Theory B, 2004)

Graph Minors. XX. Wagner's conjecture. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 2004)

Graph Minors. XIX. Well-quasi-ordering on a surface. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 2004)

The structure of claw-free graphs. - Maria Chudnovsky; Paul D. Seymour (BCC, 2005)

Recognizing Berge Graphs. - Maria Chudnovsky; Gérard Cornuéjols; Xinming Liu; Paul D. Seymour; Kristina Vuskovic (Comb., 2005)

Detecting even holes. - Maria Chudnovsky; Ken-ichi Kawarabayashi; Paul D. Seymour (J. Graph Theory, 2005)

Certifying large branch-width. - Sang-il Oum; Paul D. Seymour (SODA, 2006)

Packing Non-Zero A-Paths In Group-Labelled Graphs. - Maria Chudnovsky; Jim Geelen; Bert Gerards; Luis A. Goddyn; Michael Lohman; Paul D. Seymour (Comb., 2006)

Solution of two fractional packing problems of Lovász. - Alexander Schrijver; Paul D. Seymour (Discret. Math., 2006)

Proper minor-closed families are small. - Serguei Norine; Paul D. Seymour; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2006)

Approximating clique-width and branch-width. - Sang-il Oum; Paul D. Seymour (J. Comb. Theory B, 2006)

Testing for a theta. - Maria Chudnovsky; Paul D. Seymour (SODA, 2007)

The roots of the independence polynomial of a clawfree graph. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2007)

Claw-free graphs. I. Orientable prismatic graphs. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2007)

Testing branch-width. - Sang-il Oum; Paul D. Seymour (J. Comb. Theory B, 2007)

Cycles in dense digraphs. - Maria Chudnovsky; Paul D. Seymour; Blair D. Sullivan (Comb., 2008)

Bisimplicial vertices in even-hole-free graphs. - Louigi Addario-Berry; Maria Chudnovsky; Frédéric Havet; Bruce A. Reed; Paul D. Seymour (J. Comb. Theory B, 2008)

Solution of three problems of Cornuéjols. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2008)

Claw-free graphs. II. Non-orientable prismatic graphs. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2008)

Claw-free graphs. III. Circular interval graphs. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2008)

Claw-free graphs. IV. Decomposition theorem. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2008)

Claw-free graphs. V. Global structure. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2008)

Even pairs in Berge graphs. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2009)

On the odd-minor variant of Hadwiger's conjecture. - Jim Geelen; Bert Gerards; Bruce A. Reed; Paul D. Seymour; Adrian Vetta (J. Comb. Theory B, 2009)

Graph minors. XXI. Graphs with unique linkages. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 2009)

The three-in-a-tree problem. - Maria Chudnovsky; Paul D. Seymour (Comb., 2010)

Counting paths in digraphs. - Paul D. Seymour; Blair D. Sullivan (Eur. J. Comb., 2010)

K4-free graphs with no odd holes. - Maria Chudnovsky; Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 2010)

Claw-free graphs VI. Colouring. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2010)

Graph minors XXIII. Nash-Williams' immersion conjecture. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 2010)

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

The edge-density for K2, t minors. - Maria Chudnovsky; Bruce A. Reed; Paul D. Seymour (J. Comb. Theory B, 2011)

A well-quasi-order for tournaments. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2011)

Finding minimum clique capacity. - Maria Chudnovsky; Sang-il Oum; Paul D. Seymour (Comb., 2012)

Packing seagulls. - Maria Chudnovsky; Paul D. Seymour (Comb., 2012)

Perfect matchings in planar cubic graphs. - Maria Chudnovsky; Paul D. Seymour (Comb., 2012)

Tournament immersion and cutwidth. - Maria Chudnovsky; Alexandra Ovetsky Fradkin; Paul D. Seymour (J. Comb. Theory B, 2012)

Three-colourable perfect graphs without even pairs. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2012)

Claw-free graphs. VII. Quasi-line graphs. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2012)

Graph Minors. XXII. Irrelevant vertices in linkage problems. - Neil Robertson 001; Paul D. Seymour (J. Comb. Theory B, 2012)

Growing Without Cloning. - Maria Chudnovsky; Paul D. Seymour (SIAM J. Discret. Math., 2012)

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

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

Detecting an induced net subdivision. - Maria Chudnovsky; Paul D. Seymour; Nicolas Trotignon (J. Comb. Theory B, 2013)

Tournament pathwidth and topological containment. - Alexandra Ovetsky Fradkin; Paul D. Seymour (J. Comb. Theory B, 2013)

A counterexample to a conjecture of Schwartz. - Felix Brandt 001; Maria Chudnovsky; Ilhee Kim; Gaku Liu; Sergey Norin; Alex Scott 001; Paul D. Seymour; Stéphan Thomassé (Soc. Choice Welf., 2013)

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

Reducibility in the Four-Color Theorem. - Neil Robertson 001; Daniel P. Sanders 001; Paul D. Seymour; Robin Thomas 001 (CoRR, 2014)

Discharging cartwheels. - Neil Robertson 001; Daniel P. Sanders 001; Paul D. Seymour; Robin Thomas 001 (CoRR, 2014)

Proof of a conjecture of Bowlin and Brin on four-colouring triangulations. - Paul D. Seymour (Eur. J. Comb., 2014)

Tournaments with near-linear transitive subsets. - Krzysztof Choromanski; Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2014)

Extending the Gyárfás-Sumner conjecture. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2014)

Rao's degree sequence conjecture. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2014)

Excluding pairs of graphs. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2014)

Excluding paths and antipaths. - Maria Chudnovsky; Paul D. Seymour (Comb., 2015)

Excluding A Grid Minor In Planar Digraphs. - Thor Johnson; Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (CoRR, 2015)

Wheel-free planar graphs. - Pierre Aboulker; Maria Chudnovsky; Paul D. Seymour; Nicolas Trotignon (Eur. J. Comb., 2015)

Edge-colouring seven-regular planar graphs. - Maria Chudnovsky; Katherine Edwards; Ken-ichi Kawarabayashi; Paul D. Seymour (J. Comb. Theory B, 2015)

Edge-colouring eight-regular planar graphs. - Maria Chudnovsky; Katherine Edwards; Paul D. Seymour (J. Comb. Theory B, 2015)

Edge-disjoint paths in digraphs with bounded independence number. - Alexandra Ovetsky Fradkin; Paul D. Seymour (J. Comb. Theory B, 2015)

Tournament minors. - Ilhee Kim; Paul D. Seymour (J. Comb. Theory B, 2015)

Tree-width and planar minors. - Alexander Leaf; Paul D. Seymour (J. Comb. Theory B, 2015)

Criticality for multicommodity flows. - Paul D. Seymour (J. Comb. Theory B, 2015)

Excluding a Substar and an Antisubstar. - Maria Chudnovsky; Sergey Norin; Bruce A. Reed; Paul D. Seymour (SIAM J. Discret. Math., 2015)

A Relative of Hadwiger's Conjecture. - Katherine Edwards; Dong Yeap Kang; Jaehoon Kim; Sang-il Oum; Paul D. Seymour (SIAM J. Discret. Math., 2015)

Hadwiger's Conjecture. - Paul D. Seymour (Open Problems in Mathematics, 2016)

Immersion in four-edge-connected graphs. - Maria Chudnovsky; Zdenek Dvorák 001; Tereza Klimosová; Paul D. Seymour (J. Comb. Theory B, 2016)

Disjoint dijoins. - Maria Chudnovsky; Katherine Edwards; Ringi Kim; Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2016)

Bipartite minors. - Maria Chudnovsky; Gil Kalai; Eran Nevo; Isabella Novik; Paul D. Seymour (J. Comb. Theory B, 2016)

Unavoidable induced subgraphs in large graphs with no homogeneous sets. - Maria Chudnovsky; Ringi Kim; Sang-il Oum; Paul D. Seymour (J. Comb. Theory B, 2016)

Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2016)

Three-edge-colouring doublecross cubic graphs. - Katherine Edwards; Daniel P. Sanders 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 2016)

Induced subgraphs of graphs with large chromatic number. I. Odd holes. - Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2016)

Tree-chromatic number. - Paul D. Seymour (J. Comb. Theory B, 2016)

Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (Comb., 2017)

Majority Colourings of Digraphs. - Stephan Kreutzer; Sang-il Oum; Paul D. Seymour; Dominic van der Zypen; David R. Wood (Electron. J. Comb., 2017)

Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths. - Alex Scott 001; Paul D. Seymour (Electron. J. Comb., 2017)

Colouring perfect graphs with bounded clique number. - Maria Chudnovsky; Aurélie Lagoutte; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2017)

Rooted grid minors. - Dániel Marx; Paul D. Seymour; Paul Wollan (J. Comb. Theory B, 2017)

Cyclically five-connected cubic graphs. - Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 2017)

Triangle-free graphs with no six-vertex induced path. - Maria Chudnovsky; Paul D. Seymour; Sophie Spirkl; Mingxian Zhong (Discret. Math., 2018)

Domination in tournaments. - Maria Chudnovsky; Ringi Kim; Chun-Hung Liu; Paul D. Seymour; Stéphan Thomassé (J. Comb. Theory B, 2018)

Even pairs and prism corners in square-free Berge graphs. - Maria Chudnovsky; Frédéric Maffray; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2018)

Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39]. - Maria Chudnovsky; Frédéric Maffray; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2018)

Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes. - Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2018)

Towards Erdős-Hajnal for Graphs with No 5-Hole. - Maria Chudnovsky; Jacob Fox; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Comb., 2019)

Clustered Colouring in Minor-Closed Classes. - Sergey Norin; Alex Scott 001; Paul D. Seymour; David R. Wood (Comb., 2019)

Girth Six Cubic Graphs Have Petersen Minors. - Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (Comb., 2019)

Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue. - Alex D. Scott; Paul D. Seymour (Comb., 2019)

H-colouring Pt-free graphs in subexponential time. - Carla Groenland; Karolina Okrasa; Pawel Rzazewski; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Discret. Appl. Math., 2019)

Large rainbow matchings in general graphs. - Ron Aharoni; Eli Berger; Maria Chudnovsky; David M. Howard 002; Paul D. Seymour (Eur. J. Comb., 2019)

Induced subgraphs of graphs with large chromatic number. XI. Orientations. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (Eur. J. Comb., 2019)

Disjoint paths in unions of tournaments. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2019)

Caterpillars in Erdős-Hajnal. - Anita Liebenau; Marcin Pilipczuk; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2019)

Near-domination in graphs. - Bruce A. Reed; Alex Scott 001; Paul D. Seymour (J. Comb. Theory A, 2019)

Excluded minors in cubic graphs. - Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 2019)

Induced subgraphs of graphs with large chromatic number. XII. Distant stars. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (J. Graph Theory, 2019)

Bad news for chordal partitions. - Alex Scott 001; Paul D. Seymour; David R. Wood (J. Graph Theory, 2019)

Short Directed Cycles in Bipartite Digraphs. - Paul D. Seymour; Sophie Spirkl (Comb., 2020)

Excluding the fork and antifork. - Maria Chudnovsky; Linda Cook; Paul D. Seymour (Discret. Math., 2020)

Induced subgraphs of graphs with large chromatic number. XIII. New brooms. - Alex Scott 001; Paul D. Seymour (Eur. J. Comb., 2020)

Detecting an Odd Hole. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (J. ACM, 2020)

Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory, Ser. B, 2020)

Corrigendum to "Bisimplicial vertices in even-hole-free graphs". - Louigi Addario-Berry; Maria Chudnovsky; Frédéric Havet; Bruce A. Reed; Paul D. Seymour (J. Comb. Theory B, 2020)

Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture. - Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2020)

Induced subgraphs of graphs with large chromatic number. VI. Banana trees. - Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2020)

Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. - Maria Chudnovsky; Jacob Fox; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2020)

A survey of χ-boundedness. - Alex Scott 001; Paul D. Seymour (J. Graph Theory, 2020)

Detecting a Long Odd Hole. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (Comb., 2021)

Pure Pairs. II. Excluding All Subdivisions of A Graph. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Comb., 2021)

Finding an induced path that is not a shortest path. - Eli Berger; Paul D. Seymour; Sophie Spirkl (Discret. Math., 2021)

New examples of minimal non-strongly-perfect graphs. - Maria Chudnovsky; Cemil Dibek; Paul D. Seymour (Discret. Math., 2021)

A note on simplicial cliques. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Discret. Math., 2021)

Erdős-Hajnal for cap-free graphs. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2021)

Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2021)

Finding a Shortest Odd Hole. - Maria Chudnovsky; Alex Scott 001; Paul D. Seymour (ACM Trans. Algorithms, 2021)

Concatenating Bipartite Graphs. - Maria Chudnovsky; Patrick Hompe; Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Electron. J. Comb., 2022)

Detecting a long even hole. - Linda Cook; Paul D. Seymour (Eur. J. Comb., 2022)

Polynomial bounds for chromatic number II: Excluding a star-forest. - Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2022)

Polynomial bounds for chromatic number. III. Excluding a double star. - Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2022)

Pure Pairs VI: Excluding an Ordered Tree. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (SIAM J. Discret. Math., 2022)

Cops and robbers on P5-free graphs. - Maria Chudnovsky; Sergey Norin; Paul D. Seymour; Jérémie Turcotte (CoRR, 2023)

Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree. - Alexander D. Scott; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2023)

Polynomial bounds for chromatic number VI. Adding a four-vertex path. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Eur. J. Comb., 2023)

Pure Pairs. V. Excluding Some Long Subdivision. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Comb., 2023)

Even-hole-free graphs still have bisimplicial vertices. - Maria Chudnovsky; Paul D. Seymour (J. Comb. Theory B, 2023)

Pure pairs. IV. Trees in bipartite graphs. - Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2023)

Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2023)

Proof of a conjecture of Plummer and Zha. - Maria Chudnovsky; Paul D. Seymour (J. Graph Theory, 2023)

Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Comb., 2023)

Strengthening Rödl's theorem. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2023)

Polynomial bounds for chromatic number VII. Disjoint holes. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Graph Theory, 2023)

Clique covers of H-free graphs. - Tung Nguyen 004; Alexander Scott 001; Paul D. Seymour; Stéphan Thomassé (Eur. J. Comb., 2024)

Graphs with all holes the same length. - Linda Cook; Jake Horsfield; Myriam Preissmann; Cléophée Robin; Paul D. Seymour; Ni Luh Dewi Sintiari; Nicolas Trotignon; Kristina Vuskovic (J. Comb. Theory B, 2024)

Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph. - Tung Nguyen 004; Alex Scott 001; Paul D. Seymour (J. Graph Theory, 2024)

Induced Subgraphs of Bounded Treewidth and the Container Method. - Tara Abrishami; Maria Chudnovsky; Marcin Pilipczuk; Pawel Rzazewski; Paul D. Seymour (SIAM J. Comput., 2024)

Pure pairs. X. Tournaments and the strong Erdős-Hajnal property. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Eur. J. Comb., 2024)

Bipartite graphs with no K6 minor. - Maria Chudnovsky; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2024)

Induced paths in graphs without anticomplete cycles. - Tung Nguyen 004; Alex D. Scott; Paul D. Seymour (J. Comb. Theory B, 2024)

Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph. - Alex D. Scott; Paul D. Seymour (J. Comb. Theory B, 2024)

On a problem of El-Zahar and Erdős. - Tung Nguyen 004; Alex D. Scott; Paul D. Seymour (J. Comb. Theory B, 2024)

Cops and Robbers on ( boldsymbol{P_5} )-Free Graphs. - Maria Chudnovsky; Sergey Norin; Paul D. Seymour; Jérémie Turcotte (SIAM J. Discret. Math., 2024)

Pure Pairs. IX. Transversal Trees. - Alex D. Scott; Paul D. Seymour; Sophie Theresa Spirkl (SIAM J. Discret. Math., 2024)

A Note on the Gyárfás-Sumner Conjecture. - Tung Nguyen 004; Alex Scott 001; Paul D. Seymour (Graphs Comb., 2024)

Bounded-Diameter Tree-Decompositions. - Eli Berger; Paul D. Seymour (Comb., 2024)

Pure Pairs. VIII. Excluding a Sparse Graph. - Alex Scott 001; Paul D. Seymour; Sophie Spirkl (Comb., 2024)

Graphs without a 3-Connected Subgraph are 4-Colourable. - Édouard Bonnet; Carl Feghali; Tung Nguyen 004; Alex Scott 001; Paul D. Seymour; Stéphan Thomassé; Nicolas Trotignon (Electron. J. Comb., 2025)

Induced subgraph density. II. Sparse and dense sets in cographs. - Jacob Fox; Tung Nguyen 004; Alex D. Scott; Paul D. Seymour (Eur. J. Comb., 2025)

A counterexample to the coarse Menger conjecture. - Tung Nguyen 004; Alex D. Scott; Paul D. Seymour (J. Comb. Theory B, 2025)

Some results and problems on tournament structure. - Tung Nguyen 004; Alex Scott 001; Paul D. Seymour (J. Comb. Theory B, 2025)