Paul Seymour

发表

Graph structure theory : proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, held June 22 to July 5, 1991, with support from the National Science Foundation and the Office of Naval Research

Neil Robertson, Paul Seymour, 1993 .

Excluded minors in cubic graphs

Robin Thomas, Paul Seymour, Neil Robertson, 2019, J. Comb. Theory, Ser. B.

On Tutte's extension of the four-colour problem

Paul Seymour, P. Seymour, 1981, J. Comb. Theory, Ser. B.

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, USA

Paul Seymour, G. Neil Robertson, P. Seymour, 1993, Graph Structure Theory.

The Complexity of Multiterminal Cuts

Mihalis Yannakakis, Christos H. Papadimitriou, Paul Seymour, 1994, SIAM J. Comput..

Excluding the fork and antifork

Maria Chudnovsky, Linda Cook, Paul Seymour, 2020, Discret. Math..

Graph Minors .XIII. The Disjoint Paths Problem

Neil Robertson, Paul Seymour, P. Seymour, 1995, J. Comb. Theory B.

Corrigendum to "Bisimplicial vertices in even-hole-free graphs"

Maria Chudnovsky, Paul Seymour, Louigi Addario-Berry, 2020, J. Comb. Theory, Ser. B.

Bounding the vertex cover number of a hypergraph

Paul Seymour, Peter Winkler, Guoli Ding, 1994, Comb..

Hadwiger's Conjecture

Paul Seymour, P. Seymour, Paul D. Seymour, 2016, Open Problems in Mathematics.

Sachs' Linkless Embedding Conjecture

Robin Thomas, Neil Robertson, Paul Seymour, 1995, J. Comb. Theory, Ser. B.

Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering

Neil Robertson, Paul Seymour, P. Seymour, 2003, J. Comb. Theory, Ser. B.

Quickly Excluding a Planar Graph

Robin Thomas, Neil Robertson, Paul Seymour, 1994, J. Comb. Theory, Ser. B.

The complexity of multiway cuts (extended abstract)

Mihalis Yannakakis, Christos H. Papadimitriou, David S. Johnson, 1992, STOC '92.

Triples in Matroid Circuits

Paul Seymour, P. Seymour, 1986, Eur. J. Comb..

Multicommodity flows in planar graphs

Haruko Okamura, Paul Seymour, P. Seymour, 1981, J. Comb. Theory, Ser. B.

Pure Pairs. II. Excluding All Subdivisions of A Graph

Maria Chudnovsky, Paul Seymour, Sophie Spirkl, 2021, Comb..

New examples of minimal non-strongly-perfect graphs

Maria Chudnovsky, Paul Seymour, Cemil Dibek, 2021, Discret. Math..

Pure Pairs VI: Excluding an Ordered Tree

Paul Seymour, Sophie Spirkl, Alex Scott, 2020, SIAM J. Discret. Math..

Polynomial bounds for chromatic number. IV. A near-polynomial bound for excluding the five-vertex path

Paul Seymour, Sophie Spirkl, Alex Scott, 2021 .

Detecting a Long Odd Hole

Maria Chudnovsky, Paul Seymour, Alex Scott, 2021, Comb..

Polynomial bounds for chromatic number II: Excluding a star‐forest

Paul Seymour, Sophie Spirkl, Alex Scott, 2021, J. Graph Theory.

Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings

Maria Chudnovsky, Paul Seymour, Alex Scott, 2016, J. Comb. Theory, Ser. B.

Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree

Paul Seymour, Sophie Spirkl, Alex Scott, 2021, J. Graph Theory.

Finding an induced path that is not a shortest path

Paul Seymour, Eli Berger, Sophie Spirkl, 2021, Discret. Math..

Proof of a conjecture of Plummer and Zha

Maria Chudnovsky, Paul Seymour, 2022 .

A note on simplicial cliques

Maria Chudnovsky, Paul Seymour, Sophie Spirkl, 2021, Discret. Math..

Graphs with all holes the same length

Nicolas Trotignon, Myriam Preissmann, Paul Seymour, 2021 .

Finding a Shortest Odd Hole

Maria Chudnovsky, Paul Seymour, Alex Scott, 2021, ACM Trans. Algorithms.

Polynomial bounds for chromatic number. III. Excluding a double star

Paul Seymour, Sophie Spirkl, Alex Scott, 2021, J. Graph Theory.

Pure pairs. IX. Transversal trees

Paul Seymour, Sophie Spirkl, Alex Scott, 2021 .

Holes with hats and Erdős-Hajnal

Maria Chudnovsky, Paul Seymour, P. Seymour, 2020 .

Trees and linear anticomplete pairs

Maria Chudnovsky, Paul Seymour, Sophie Spirkl, 2018, 1809.00919.

Detecting Matroid Minors

Paul Seymour, P. N. Walton, P. Seymour, 1981 .

Disjoint Paths—A Survey

Neil Robertson, Paul Seymour, 1985 .

On forbidden minors for (3)

Paul Seymour, Jeff Kahn, 1988 .

Claw-free graphs I . Clique cutsets

Maria Chudnovsky, Paul Seymour, .

Even-hole-free graphs still have bisimplicial vertices

Maria Chudnovsky, Paul Seymour, P. Seymour, 2019, J. Comb. Theory, Ser. B.

A survey of $\chi$-boundedness

Paul Seymour, Alex Scott, A. Scott, 2018, 1812.07500.

A Structure Theorem for Claw-Free Perfect Graphs

Maria Chudnovsky, Paul Seymour, .

Excluding Infinite Clique Minors

Neil Robertson, Paul Seymour, Robin Thomas, 1995 .

Detecting even holes

Ken-ichi Kawarabayashi, Maria Chudnovsky, Paul Seymour, 2005 .

Uniqueness of highly representative surface embeddings

Paul Seymour, Robin Thomas, 1996 .

Induced subgraphs of graphs with large chromatic number . XII . Two-legged caterpillars

Maria Chudnovsky, Paul Seymour, 2017 .

Disjoint paths in tournaments

Maria Chudnovsky, Paul Seymour, Alex Scott, 2014, 1411.6226.

Non-Planar Extensions Of Planar Graphs

Paul Seymour, Robin Thomas, P. Seymour, 1999 .

A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS

Paul Seymour, 1976 .

The Forbidden Minors of Binary Clutters

Paul Seymour, P. Seymour, 1976 .

Cut Coloring and Circuit Covering

Matt DeVos, Paul Seymour, Thor Johnson, 2006 .

Sparse graphs without linear anticomplete pairs

Maria Chudnovsky, Paul Seymour, Sophie Spirkl, 2018, 1804.01060.

The metamathematics of the graph minor theorem

Paul Seymour, P. Seymour, G. Neil Robertson, 1985 .

Excluding subdivisions of infinite cliques

Neil Robertson, Paul Seymour, Robin Thomas, 1992 .

quasi-line graphs

Maria Chudnovsky, Paul Seymour, Andrew D. King, 2011 .

Long cycles in critical graphs

Noga Alon, Michael Krivelevich, Paul Seymour, 2000 .

An end-faithful spanning tree counterexample

Paul Seymour, Robin Thomas, 1991 .

Pure pairs. I. Trees and linear anticomplete pairs

Maria Chudnovsky, Paul Seymour, Sophie Spirkl, 2018 .

Forbidden structures and algorithms in graphs and digraphs

Maria Chudnovsky, Paul Seymour, Alexandra Fradkin, 2011 .

Pure pairs. II. Sparse graphs without linear anticomplete pairs

Maria Chudnovsky, Paul Seymour, Sophie Spirkl, 2020 .

On the points-lines-planes conjecture

Paul Seymour, 1982 .

Eulerian digraph immersion

Paul Seymour, P. Seymour, C. Johnson, 2002 .

Finding balanced skew partitions in perfect graphs

Maria Chudnovsky, Paul Seymour, Sophie Spirkl, 2015 .

Simplicial cliques in claw-free graphs

Maria Chudnovsky, Paul Seymour, P. Seymour, 2012 .