Paul D. Seymour

According to our database1, Paul D. Seymour authored at least 200 papers between 1977 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Bad news for chordal partitions.
Journal of Graph Theory, 2019

Near-domination in graphs.
J. Comb. Theory, Ser. A, 2019

Caterpillars in Erdős-Hajnal.
J. Comb. Theory, Ser. B, 2019

Disjoint paths in unions of tournaments.
J. Comb. Theory, Ser. B, 2019

Induced subgraphs of graphs with large chromatic number. XI. Orientations.
Eur. J. Comb., 2019

Large rainbow matchings in general graphs.
Eur. J. Comb., 2019

2018
Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes.
J. Comb. Theory, Ser. B, 2018

Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39].
J. Comb. Theory, Ser. B, 2018

Even pairs and prism corners in square-free Berge graphs.
J. Comb. Theory, Ser. B, 2018

Domination in tournaments.
J. Comb. Theory, Ser. B, 2018

Triangle-free graphs with no six-vertex induced path.
Discrete Mathematics, 2018

2017
Cyclically five-connected cubic graphs.
J. Comb. Theory, Ser. B, 2017

Rooted grid minors.
J. Comb. Theory, Ser. B, 2017

Colouring perfect graphs with bounded clique number.
J. Comb. Theory, Ser. B, 2017

Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths.
Electr. J. Comb., 2017

Majority Colourings of Digraphs.
Electr. J. Comb., 2017

Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes.
Combinatorica, 2017

2016
Tree-chromatic number.
J. Comb. Theory, Ser. B, 2016

Induced subgraphs of graphs with large chromatic number. I. Odd holes.
J. Comb. Theory, Ser. B, 2016

Three-edge-colouring doublecross cubic graphs.
J. Comb. Theory, Ser. B, 2016

Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures.
J. Comb. Theory, Ser. B, 2016

Unavoidable induced subgraphs in large graphs with no homogeneous sets.
J. Comb. Theory, Ser. B, 2016

Bipartite minors.
J. Comb. Theory, Ser. B, 2016

Disjoint dijoins.
J. Comb. Theory, Ser. B, 2016

Immersion in four-edge-connected graphs.
J. Comb. Theory, Ser. B, 2016

2015
A Relative of Hadwiger's Conjecture.
SIAM J. Discrete Math., 2015

Excluding a Substar and an Antisubstar.
SIAM J. Discrete Math., 2015

Criticality for multicommodity flows.
J. Comb. Theory, Ser. B, 2015

Tree-width and planar minors.
J. Comb. Theory, Ser. B, 2015

Tournament minors.
J. Comb. Theory, Ser. B, 2015

Edge-disjoint paths in digraphs with bounded independence number.
J. Comb. Theory, Ser. B, 2015

Edge-colouring eight-regular planar graphs.
J. Comb. Theory, Ser. B, 2015

Edge-colouring seven-regular planar graphs.
J. Comb. Theory, Ser. B, 2015

Wheel-free planar graphs.
Eur. J. Comb., 2015

Excluding paths and antipaths.
Combinatorica, 2015

2014
Excluding pairs of graphs.
J. Comb. Theory, Ser. B, 2014

Rao's degree sequence conjecture.
J. Comb. Theory, Ser. B, 2014

Extending the Gyárfás-Sumner conjecture.
J. Comb. Theory, Ser. B, 2014

Tournaments with near-linear transitive subsets.
J. Comb. Theory, Ser. B, 2014

Proof of a conjecture of Bowlin and Brin on four-colouring triangulations.
Eur. J. Comb., 2014

2013
A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs.
SIAM J. Discrete Math., 2013

A counterexample to a conjecture of Schwartz.
Social Choice and Welfare, 2013

Tournament pathwidth and topological containment.
J. Comb. Theory, Ser. B, 2013

Detecting an induced net subdivision.
J. Comb. Theory, Ser. B, 2013

Tournaments and colouring.
J. Comb. Theory, Ser. B, 2013

2012
Growing Without Cloning.
SIAM J. Discrete Math., 2012

Graph Minors. XXII. Irrelevant vertices in linkage problems.
J. Comb. Theory, Ser. B, 2012

Claw-free graphs. VII. Quasi-line graphs.
J. Comb. Theory, Ser. B, 2012

Three-colourable perfect graphs without even pairs.
J. Comb. Theory, Ser. B, 2012

Tournament immersion and cutwidth.
J. Comb. Theory, Ser. B, 2012

Perfect matchings in planar cubic graphs.
Combinatorica, 2012

Packing seagulls.
Combinatorica, 2012

Finding minimum clique capacity.
Combinatorica, 2012

2011
A well-quasi-order for tournaments.
J. Comb. Theory, Ser. B, 2011

The edge-density for K2, t minors.
J. Comb. Theory, Ser. B, 2011

2010
Graph minors XXIII. Nash-Williams' immersion conjecture.
J. Comb. Theory, Ser. B, 2010

Claw-free graphs VI. Colouring.
J. Comb. Theory, Ser. B, 2010

K4-free graphs with no odd holes.
J. Comb. Theory, Ser. B, 2010

Counting paths in digraphs.
Eur. J. Comb., 2010

The three-in-a-tree problem.
Combinatorica, 2010

Analyzing the performance of greedy maximal scheduling via local pooling and graph theory.
Proceedings of the 2010 ACM workshop on Wireless of the students, 2010

Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009
Graph minors. XXI. Graphs with unique linkages.
J. Comb. Theory, Ser. B, 2009

On the odd-minor variant of Hadwiger's conjecture.
J. Comb. Theory, Ser. B, 2009

Even pairs in Berge graphs.
J. Comb. Theory, Ser. B, 2009

2008
Claw-free graphs. V. Global structure.
J. Comb. Theory, Ser. B, 2008

Claw-free graphs. IV. Decomposition theorem.
J. Comb. Theory, Ser. B, 2008

Claw-free graphs. III. Circular interval graphs.
J. Comb. Theory, Ser. B, 2008

Claw-free graphs. II. Non-orientable prismatic graphs.
J. Comb. Theory, Ser. B, 2008

Solution of three problems of Cornuéjols.
J. Comb. Theory, Ser. B, 2008

Bisimplicial vertices in even-hole-free graphs.
J. Comb. Theory, Ser. B, 2008

Cycles in dense digraphs.
Combinatorica, 2008

2007
Testing branch-width.
J. Comb. Theory, Ser. B, 2007

Claw-free graphs. I. Orientable prismatic graphs.
J. Comb. Theory, Ser. B, 2007

The roots of the independence polynomial of a clawfree graph.
J. Comb. Theory, Ser. B, 2007

Testing for a theta.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
Approximating clique-width and branch-width.
J. Comb. Theory, Ser. B, 2006

Proper minor-closed families are small.
J. Comb. Theory, Ser. B, 2006

Disjoint paths in graphs.
Discrete Mathematics, 2006

Solution of two fractional packing problems of Lovász.
Discrete Mathematics, 2006

Packing Non-Zero A-Paths In Group-Labelled Graphs.
Combinatorica, 2006

Certifying large branch-width.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Detecting even holes.
Journal of Graph Theory, 2005

Recognizing Berge Graphs.
Combinatorica, 2005

The structure of claw-free graphs.
Proceedings of the Surveys in Combinatorics, 2005

2004
Graph Minors. XIX. Well-quasi-ordering on a surface.
J. Comb. Theory, Ser. B, 2004

Graph Minors. XX. Wagner's conjecture.
J. Comb. Theory, Ser. B, 2004

Excluding any graph as a minor allows a low tree-width 2-coloring.
J. Comb. Theory, Ser. B, 2004

Hadwiger's conjecture for line graphs.
Eur. J. Comb., 2004

2003
Progress on perfect graphs.
Math. Program., 2003

Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering.
J. Comb. Theory, Ser. B, 2003

Graph Minors. XVI. Excluding a non-planar graph.
J. Comb. Theory, Ser. B, 2003

Extending partial 3-colourings in a planar graph.
J. Comb. Theory, Ser. B, 2003

Tour Merging via Branch-Decomposition.
INFORMS Journal on Computing, 2003

2002
Coloring Locally Bipartite Graphs on Surfaces.
J. Comb. Theory, Ser. B, 2002

Colouring Eulerian Triangulations.
J. Comb. Theory, Ser. B, 2002

2001
Spanning trees with many leaves.
Journal of Graph Theory, 2001

Directed Tree-Width.
J. Comb. Theory, Ser. B, 2001

Node Placement and Sizing for Copper Broadband Access Networks.
Annals OR, 2001

2000
Long cycles in critical graphs.
Journal of Graph Theory, 2000

1999
The Ring Loading Problem.
SIAM Review, 1999

Graph Minors: XVII. Taming a Vortex.
J. Comb. Theory, Ser. B, 1999

1998
The Ring Loading Problem.
SIAM J. Discrete Math., 1998

A Petersen on a Pentagon.
J. Comb. Theory, Ser. B, 1998

A Note on List Arboricity.
J. Comb. Theory, Ser. B, 1998

Fractional Colouring and Hadwiger's Conjecture.
J. Comb. Theory, Ser. B, 1998

AETGSM Web: A Web Based Service for Automatic Efficient Test Generation from Functional Requirements.
Proceedings of the 2nd Workshop on Industrial-Strength Formal Specification Techniques (WIFT '98), 1998

1997
Two Chromatic Polynomial Conjectures.
J. Comb. Theory, Ser. B, 1997

Tutte's Edge-Colouring Conjecture.
J. Comb. Theory, Ser. B, 1997

The Four-Colour Theorem.
J. Comb. Theory, Ser. B, 1997

Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
Uniqueness of highly representative surface embeddings.
Journal of Graph Theory, 1996

Graph Minors: XV. Giant Steps.
J. Comb. Theory, Ser. B, 1996

Irreducible Triangulations of Surfaces.
J. Comb. Theory, Ser. B, 1996

Packing Circuits in Eulerian Digraphs.
Combinatorica, 1996

Packing Directed Circuits.
Combinatorica, 1996

Efficiently Four-Coloring Planar Graphs.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995
Sachs' Linkless Embedding Conjecture.
J. Comb. Theory, Ser. B, 1995

Petersen Family Minors.
J. Comb. Theory, Ser. B, 1995

Kuratowski Chains.
J. Comb. Theory, Ser. B, 1995

Graph Minors .XIII. The Disjoint Paths Problem.
J. Comb. Theory, Ser. B, 1995

Graph Minors .XII. Distance on a Surface.
J. Comb. Theory, Ser. B, 1995

Graph Miners .XIV. Extending an Embedding.
J. Comb. Theory, Ser. B, 1995

Packing Directed Circuits Fractionally.
Combinatorica, 1995

1994
Planar Separators.
SIAM J. Discrete Math., 1994

The Complexity of Multiterminal Cuts.
SIAM J. Comput., 1994

A Note on Hyperplane Generation.
J. Comb. Theory, Ser. B, 1994

Packing Odd Paths.
J. Comb. Theory, Ser. B, 1994

Quickly Excluding a Planar Graph.
J. Comb. Theory, Ser. B, 1994

Graph Minors. XI. Circuits on a Surface.
J. Comb. Theory, Ser. B, 1994

Circular embeddings of planar graphs in nonspherical surfaces.
Discrete Mathematics, 1994

Call Routing and the Ratcatcher.
Combinatorica, 1994

Bounding the Vertex Cover Number of a Hypergraph.
Combinatorica, 1994

1993
Graph Searching and a Min-Max Theorem for Tree-Width.
J. Comb. Theory, Ser. B, 1993

Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle.
J. Comb. Theory, Ser. B, 1993

Hadwiger's conjecture for K 6-free graphs.
Combinatorica, 1993

On the fractional matching polytope of a hypergraph.
Combinatorica, 1993

1992
Disjoint Paths in a Planar Graph - A General Theorem.
SIAM J. Discrete Math., 1992

On secret-sharing matroids.
J. Comb. Theory, Ser. B, 1992

Directed triangles in directed graphs.
Discrete Mathematics, 1992

A fractional version of the Erdös-Faber-Lovász conjecture.
Combinatorica, 1992

The Complexity of Multiway Cuts (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991
A simpler proof and a generalization of the zero-trees theorem.
J. Comb. Theory, Ser. A, 1991

Graph minors. X. Obstructions to tree-decomposition.
J. Comb. Theory, Ser. B, 1991

Quickly excluding a forest.
J. Comb. Theory, Ser. B, 1991

Monotonicity in Graph Searching.
J. Algorithms, 1991

An end-faithful spanning tree counterexample.
Discrete Mathematics, 1991

Excluding infinite minors.
Discrete Mathematics, 1991

Directed circuits on a torus.
Combinatorica, 1991

Structural descriptions of lower ideals of trees.
Proceedings of the Graph Structure Theory, 1991

A survey of linkless embeddings.
Proceedings of the Graph Structure Theory, 1991

Excluding a graph with one crossing.
Proceedings of the Graph Structure Theory, 1991

Finding disjoint trees in planar graphs in linear time.
Proceedings of the Graph Structure Theory, 1991

1990
Extending an edge-coloring.
Journal of Graph Theory, 1990

Graph minors. VIII. A kuratowski theorem for general surfaces.
J. Comb. Theory, Ser. B, 1990

Graph minors. IV. Tree-width and well-quasi-ordering.
J. Comb. Theory, Ser. B, 1990

Graph minors. IX. Disjoint crossed paths.
J. Comb. Theory, Ser. B, 1990

Colouring series-parallel graphs.
Combinatorica, 1990

A Separator Theorem for Graphs with an Excluded Minor and its Applications
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

On Lehman's Width-Length Characterization.
Proceedings of the Polyhedral Combinatorics, 1990

Spanning Trees of Different Weights.
Proceedings of the Polyhedral Combinatorics, 1990

1989
A counterexample to the rank-coloring conjecture.
Journal of Graph Theory, 1989

Graphs with small bandwidth and cutwidth.
Discrete Mathematics, 1989

1988
On the connectivity function of a matroid.
J. Comb. Theory, Ser. B, 1988

Graph minors. VII. Disjoint paths on a surface.
J. Comb. Theory, Ser. B, 1988

On induced subgraphs of the cube.
J. Comb. Theory, Ser. A, 1988

Self-organizing Sequential Search and Hilbert's Inequalities.
J. Comput. Syst. Sci., 1988

1987
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number.
Journal of Graph Theory, 1987

Characterization of even directed graphs.
J. Comb. Theory, Ser. B, 1987

Large induced degenerate subgraphs.
Graphs and Combinatorics, 1987

The smallets n-uniform hypergraph with positive discrepancy.
Combinatorica, 1987

1986
Graph minors. VI. Disjoint paths across a disc.
J. Comb. Theory, Ser. B, 1986

Graph minors. V. Excluding a planar graph.
J. Comb. Theory, Ser. B, 1986

Graph Minors. II. Algorithmic Aspects of Tree-Width.
J. Algorithms, 1986

Triples in Matroid Circuits.
Eur. J. Comb., 1986

Adjacency in Binary Matroids.
Eur. J. Comb., 1986

1985
Minors of 3-Connected Matroids.
Eur. J. Comb., 1985

Counting points in hypercubes and convolution measure algebras.
Combinatorica, 1985

Self-Organizing Sequential Search and Hilbert's Inequalities
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984
A generalization of chordal graphs.
Journal of Graph Theory, 1984

Graph minors. III. Planar tree-width.
J. Comb. Theory, Ser. B, 1984

A note on nongraphic matroids.
J. Comb. Theory, Ser. B, 1984

1983
Graph minors. I. Excluding a forest.
J. Comb. Theory, Ser. B, 1983

1982
Packing nearly-disjoint sets.
Combinatorica, 1982

1981
Nowhere-zero 6-flows.
J. Comb. Theory, Ser. B, 1981

Even circuits in planar graphs.
J. Comb. Theory, Ser. B, 1981

Matroids and Multicommodity Flows.
Eur. J. Comb., 1981

On minors of non-binary matroids.
Combinatorica, 1981

Reconizing graphic matroids.
Combinatorica, 1981

1980
Four-terminus flows.
Networks, 1980

Decomposition of regular matroids.
J. Comb. Theory, Ser. B, 1980

Packing and covering with matroid circuits.
J. Comb. Theory, Ser. B, 1980

Disjoint paths in graphs.
Discrete Mathematics, 1980

1979
A short proof of the two-commodity flow theorem.
J. Comb. Theory, Ser. B, 1979

Matroid representation over GF(3).
J. Comb. Theory, Ser. B, 1979

Solution of two fractional packing problems of lovász.
Discrete Mathematics, 1979

1978
A two-commodity cut theorem.
Discrete Mathematics, 1978

Counterexample to a conjecture of Jeurissen.
Discrete Mathematics, 1978

1977
A note on the production of matroid minors.
J. Comb. Theory, Ser. B, 1977

The matroids with the max-flow min-cut property.
J. Comb. Theory, Ser. B, 1977


  Loading...