Paul D. Seymour

J. Comb. Theory B, 2026

Distant Digraph Domination.

[BibT_eX]

[DOI]

Alexander Scott

Electron. J. Comb., 2026

The Vertex Sets of Subtrees of a Tree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2026

2025

Trees and near-linear stable sets.

[BibT_eX]

[DOI]

Comb., October, 2025

Subdivisions and near-linear stable sets.

[BibT_eX]

[DOI]

Comb., August, 2025

Some results and problems on tournament structure.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2025

A counterexample to the coarse Menger conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2025

When all directed cycles have length three.

[BibT_eX]

[DOI]

Eur. J. Comb., 2025

Induced subgraph density. II. Sparse and dense sets in cographs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2025

Graphs without a 3-Connected Subgraph are 4-Colourable.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

2024

Pure Pairs. VIII. Excluding a Sparse Graph.

[BibT_eX]

[DOI]

Comb., December, 2024

Bounded-Diameter Tree-Decompositions.

[BibT_eX]

[DOI]

Eli Berger

Comb., June, 2024

A Note on the Gyárfás-Sumner Conjecture.

[BibT_eX]

[DOI]

Graphs Comb., April, 2024

Pure Pairs. IX. Transversal Trees.

[BibT_eX]

[DOI]

Sophie Theresa Spirkl

SIAM J. Discret. Math., March, 2024

Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2024

On a problem of El-Zahar and Erdős.

[BibT_eX]

[DOI]

J. Comb. Theory B, March, 2024

Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, January, 2024

Induced paths in graphs without anticomplete cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, January, 2024

Bipartite graphs with no K6 minor.

[BibT_eX]

[DOI]

J. Comb. Theory B, January, 2024

Pure pairs. X. Tournaments and the strong Erdős-Hajnal property.

[BibT_eX]

[DOI]

Eur. J. Comb., January, 2024

Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2024

Graphs with all holes the same length.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2024

Clique covers of H-free graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

2023

Polynomial bounds for chromatic number VII. Disjoint holes.

[BibT_eX]

[DOI]

J. Graph Theory, November, 2023

Strengthening Rödl's theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, November, 2023

Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path.

[BibT_eX]

[DOI]

Comb., October, 2023

Proof of a conjecture of Plummer and Zha.

[BibT_eX]

[DOI]

J. Graph Theory, July, 2023

Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix.

[BibT_eX]

[DOI]

J. Comb. Theory B, July, 2023

Pure pairs. IV. Trees in bipartite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, July, 2023

Even-hole-free graphs still have bisimplicial vertices.

[BibT_eX]

[DOI]

J. Comb. Theory B, July, 2023

Pure Pairs. V. Excluding Some Long Subdivision.

[BibT_eX]

[DOI]

Comb., June, 2023

Polynomial bounds for chromatic number VI. Adding a four-vertex path.

[BibT_eX]

[DOI]

Eur. J. Comb., May, 2023

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

[BibT_eX]

[DOI]

Alexander D. Scott

J. Graph Theory, 2023

Cops and robbers on P5-free graphs.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Pure Pairs VI: Excluding an Ordered Tree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

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

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Polynomial bounds for chromatic number II: Excluding a star-forest.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Detecting a long even hole.

[BibT_eX]

[DOI]

Linda Cook

Eur. J. Comb., 2022

Concatenating Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

2021

Finding a Shortest Odd Hole.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Erdős-Hajnal for cap-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

A note on simplicial cliques.

[BibT_eX]

[DOI]

Discret. Math., 2021

New examples of minimal non-strongly-perfect graphs.

[BibT_eX]

[DOI]

Cemil Dibek

Discret. Math., 2021

Finding an induced path that is not a shortest path.

[BibT_eX]

[DOI]

Eli Berger

Discret. Math., 2021

Pure Pairs. II. Excluding All Subdivisions of A Graph.

[BibT_eX]

[DOI]

Comb., 2021

Detecting a Long Odd Hole.

[BibT_eX]

[DOI]

Comb., 2021

Induced subgraphs of bounded treewidth and the container method.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

A survey of χ-boundedness.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Induced subgraphs of graphs with large chromatic number. VI. Banana trees.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2020

Detecting an Odd Hole.

[BibT_eX]

[DOI]

J. ACM, 2020

Induced subgraphs of graphs with large chromatic number. XIII. New brooms.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

Excluding the fork and antifork.

[BibT_eX]

[DOI]

Linda Cook

Discret. Math., 2020

Short Directed Cycles in Bipartite Digraphs.

[BibT_eX]

[DOI]

Comb., 2020

2019

Bad news for chordal partitions.

[BibT_eX]

[DOI]

David R. Wood

J. Graph Theory, 2019

Induced subgraphs of graphs with large chromatic number. XII. Distant stars.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Excluded minors in cubic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Near-domination in graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2019

Caterpillars in Erdős-Hajnal.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Disjoint paths in unions of tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Induced subgraphs of graphs with large chromatic number. XI. Orientations.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Large rainbow matchings in general graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

H-colouring Pt-free graphs in subexponential time.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue.

[BibT_eX]

[DOI]

Comb., 2019

Girth Six Cubic Graphs Have Petersen Minors.

[BibT_eX]

[DOI]

Comb., 2019

Clustered Colouring in Minor-Closed Classes.

[BibT_eX]

[DOI]

Comb., 2019

Towards Erdős-Hajnal for Graphs with No 5-Hole.

[BibT_eX]

[DOI]

Comb., 2019

2018

Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes.

[BibT_eX]

[DOI]

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].

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Even pairs and prism corners in square-free Berge graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Domination in tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Triangle-free graphs with no six-vertex induced path.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

Cyclically five-connected cubic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Rooted grid minors.

[BibT_eX]

[DOI]

Dániel Marx

Paul Wollan

J. Comb. Theory B, 2017

Colouring perfect graphs with bounded clique number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

Majority Colourings of Digraphs.

[BibT_eX]

[DOI]

Stephan Kreutzer

Dominic van der Zypen

David R. Wood

Electron. J. Comb., 2017

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

[BibT_eX]

[DOI]

Comb., 2017

2016

Tree-chromatic number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Induced subgraphs of graphs with large chromatic number. I. Odd holes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Three-edge-colouring doublecross cubic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Unavoidable induced subgraphs in large graphs with no homogeneous sets.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Bipartite minors.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Disjoint dijoins.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Immersion in four-edge-connected graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Hadwiger's Conjecture.

[BibT_eX]

[DOI]

Proceedings of the Open Problems in Mathematics., 2016

2015

A Relative of Hadwiger's Conjecture.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Excluding a Substar and an Antisubstar.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Criticality for multicommodity flows.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Tree-width and planar minors.

[BibT_eX]

[DOI]

Alexander Leaf

J. Comb. Theory B, 2015

Tournament minors.

[BibT_eX]

[DOI]

Ilhee Kim

Alexandra Ovetsky Fradkin

J. Comb. Theory B, 2015

Edge-disjoint paths in digraphs with bounded independence number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Edge-colouring eight-regular planar graphs.

[BibT_eX]

[DOI]

Katherine Edwards

J. Comb. Theory B, 2015

Edge-colouring seven-regular planar graphs.

[BibT_eX]

[DOI]

Katherine Edwards

Ken-ichi Kawarabayashi

J. Comb. Theory B, 2015

Wheel-free planar graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Excluding A Grid Minor In Planar Digraphs.

[BibT_eX]

[DOI]

CoRR, 2015

Excluding paths and antipaths.

[BibT_eX]

[DOI]

Comb., 2015

2014

Excluding pairs of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Rao's degree sequence conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Extending the Gyárfás-Sumner conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Tournaments with near-linear transitive subsets.

[BibT_eX]

[DOI]

Krzysztof Choromanski

J. Comb. Theory B, 2014

Proof of a conjecture of Bowlin and Brin on four-colouring triangulations.

[BibT_eX]

[DOI]

Alexandra Ovetsky Fradkin

Eur. J. Comb., 2014

Discharging cartwheels.

[BibT_eX]

[DOI]

CoRR, 2014

Reducibility in the Four-Color Theorem.

[BibT_eX]

[DOI]

CoRR, 2014

2013

A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

A counterexample to a conjecture of Schwartz.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2013

Tournament pathwidth and topological containment.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Detecting an induced net subdivision.

[BibT_eX]

[DOI]

Nicolas Trotignon

J. Comb. Theory B, 2013

Tournaments and colouring.

[BibT_eX]

[DOI]

Eli Berger

Krzysztof Choromanski

J. Comb. Theory B, 2013

2012

Growing Without Cloning.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Graph Minors. XXII. Irrelevant vertices in linkage problems.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Claw-free graphs. VII. Quasi-line graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Three-colourable perfect graphs without even pairs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Tournament immersion and cutwidth.

[BibT_eX]

[DOI]

Alexandra Ovetsky Fradkin

J. Comb. Theory B, 2012

Perfect matchings in planar cubic graphs.

[BibT_eX]

[DOI]

Comb., 2012

Packing seagulls.

[BibT_eX]

[DOI]

Comb., 2012

Finding minimum clique capacity.

[BibT_eX]

[DOI]

Comb., 2012

2011

A well-quasi-order for tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

The edge-density for K2, t minors.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

A local strengthening of Reed's ω, Δ, χ conjecture for quasi-line graphs

[BibT_eX]

[DOI]

CoRR, 2011

2010

Graph minors XXIII. Nash-Williams' immersion conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Claw-free graphs VI. Colouring.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

K4-free graphs with no odd holes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Counting paths in digraphs.

[BibT_eX]

[DOI]

Blair D. Sullivan

Eur. J. Comb., 2010

The three-in-a-tree problem.

[BibT_eX]

[DOI]

Comb., 2010

Analyzing the performance of greedy maximal scheduling via local pooling and graph theory.

[BibT_eX]

[DOI]

Proceedings of the 2010 ACM workshop on Wireless of the students, 2010

2009

Graph minors. XXI. Graphs with unique linkages.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

On the odd-minor variant of Hadwiger's conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Even pairs in Berge graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

2008

Claw-free graphs. V. Global structure.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Claw-free graphs. IV. Decomposition theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Claw-free graphs. III. Circular interval graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Claw-free graphs. II. Non-orientable prismatic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Solution of three problems of Cornuéjols.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Bisimplicial vertices in even-hole-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Cycles in dense digraphs.

[BibT_eX]

[DOI]

Blair D. Sullivan

Comb., 2008

2007

Testing branch-width.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Claw-free graphs. I. Orientable prismatic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

The roots of the independence polynomial of a clawfree graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Testing for a theta.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Approximating clique-width and branch-width.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

Proper minor-closed families are small.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

Disjoint paths in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2006

Packing Non-Zero A-Paths In Group-Labelled Graphs.

[BibT_eX]

[DOI]

Comb., 2006

Certifying large branch-width.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Detecting even holes.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

J. Graph Theory, 2005

Recognizing Berge Graphs.

[BibT_eX]

[DOI]

Comb., 2005

The structure of claw-free graphs.

[BibT_eX]

Proceedings of the Surveys in Combinatorics, 2005

2004

Graph Minors. XIX. Well-quasi-ordering on a surface.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

Graph Minors. XX. Wagner's conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

Excluding any graph as a minor allows a low tree-width 2-coloring.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

Hadwiger's conjecture for line graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2004

2003

Progress on perfect graphs.

[BibT_eX]

[DOI]

Math. Program., 2003

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

Graph Minors. XVI. Excluding a non-planar graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

Extending partial 3-colourings in a planar graph.

[BibT_eX]

[DOI]

Matt DeVos

J. Comb. Theory B, 2003

Tour Merging via Branch-Decomposition.

[BibT_eX]

[DOI]

William J. Cook

INFORMS J. Comput., 2003

2002

Coloring Locally Bipartite Graphs on Surfaces.

[BibT_eX]

[DOI]

Bojan Mohar

J. Comb. Theory B, 2002

Colouring Eulerian Triangulations.

[BibT_eX]

[DOI]

Joan P. Hutchinson

R. Bruce Richter

J. Comb. Theory B, 2002

2001

Spanning trees with many leaves.

[BibT_eX]

[DOI]

Thor Johnson

J. Graph Theory, 2001

Directed Tree-Width.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Node Placement and Sizing for Copper Broadband Access Networks.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2001

2000

Long cycles in critical graphs.

[BibT_eX]

[DOI]

Michael Krivelevich

J. Graph Theory, 2000

1999

Graph Minors: XVII. Taming a Vortex.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

1998

The Ring Loading Problem.

[BibT_eX]

[DOI]

Peter Winkler

SIAM J. Discret. Math., 1998

A Petersen on a Pentagon.

[BibT_eX]

[DOI]

Klaus Truemper

J. Comb. Theory B, 1998

A Note on List Arboricity.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1998

Fractional Colouring and Hadwiger's Conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1998

AETGSM Web: A Web Based Service for Automatic Efficient Test Generation from Functional Requirements.

[BibT_eX]

[DOI]

Proceedings of the 2nd Workshop on Industrial-Strength Formal Specification Techniques (WIFT '98), 1998

1997

Two Chromatic Polynomial Conjectures.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

Tutte's Edge-Colouring Conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

The Four-Colour Theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

Uniqueness of highly representative surface embeddings.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Graph Minors: XV. Giant Steps.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1996

Irreducible Triangulations of Surfaces.

[BibT_eX]

[DOI]

Zhicheng Gao

R. Bruce Richter

J. Comb. Theory, Ser. B, 1996

Packing Circuits in Eulerian Digraphs.

[BibT_eX]

[DOI]

Comb., 1996

Packing Directed Circuits.

[BibT_eX]

[DOI]

Comb., 1996

Efficiently Four-Coloring Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

Sachs' Linkless Embedding Conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Petersen Family Minors.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Kuratowski Chains.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Graph Minors .XIII. The Disjoint Paths Problem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Graph Minors .XII. Distance on a Surface.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Graph Minors .XIV. Extending an Embedding.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Packing Directed Circuits Fractionally.

[BibT_eX]

[DOI]

Comb., 1995

1994

Planar Separators.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

SIAM J. Discret. Math., 1994

The Complexity of Multiterminal Cuts.

[BibT_eX]

[DOI]

Elias Dahlhaus

David S. Johnson

Mihalis Yannakakis

SIAM J. Comput., 1994

A Note on Hyperplane Generation.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Packing Odd Paths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Quickly Excluding a Planar Graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Graph Minors. XI. Circuits on a Surface.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Circular embeddings of planar graphs in nonspherical surfaces.

[BibT_eX]

[DOI]

R. Bruce Richter

Jozef Sirán

Discret. Math., 1994

Call Routing and the Ratcatcher.

[BibT_eX]

[DOI]

Comb., 1994

Bounding the Vertex Cover Number of a Hypergraph.

[BibT_eX]

[DOI]

Peter Winkler

Comb., 1994

1993

Graph Searching and a Min-Max Theorem for Tree-Width.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

Hadwiger's conjecture for K 6-free graphs.

[BibT_eX]

[DOI]

Comb., 1993

On the fractional matching polytope of a hypergraph.

[BibT_eX]

[DOI]

Zoltán Füredi

Jeff Kahn

Comb., 1993

1992

Disjoint Paths in a Planar Graph - A General Theorem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

On secret-sharing matroids.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

Directed triangles in directed graphs.

[BibT_eX]

[DOI]

Maurits de Graaf

Discret. Math., 1992

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

[BibT_eX]

[DOI]

Jeff Kahn

Christos H. Papadimitriou

Comb., 1992

The Complexity of Multiway Cuts (Extended Abstract)

[BibT_eX]

[DOI]

Elias Dahlhaus

David S. Johnson

Mihalis Yannakakis

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991

A simpler proof and a generalization of the zero-trees theorem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1991

Graph minors. X. Obstructions to tree-decomposition.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Quickly excluding a forest.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Monotonicity in Graph Searching.

[BibT_eX]

[DOI]

Daniel Bienstock

J. Algorithms, 1991

An end-faithful spanning tree counterexample.

[BibT_eX]

[DOI]

Discret. Math., 1991

Excluding infinite minors.

[BibT_eX]

[DOI]

Discret. Math., 1991

Directed circuits on a torus.

[BibT_eX]

[DOI]

Comb., 1991

Structural descriptions of lower ideals of trees.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

A survey of linkless embeddings.

[BibT_eX]

[DOI]

Proceedings of the Graph Structure Theory, 1991

Excluding a graph with one crossing.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

Finding disjoint trees in planar graphs in linear time.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

1990

Extending an edge-coloring.

[BibT_eX]

[DOI]

Odile Marcotte

J. Graph Theory, 1990

Graph minors. VIII. A kuratowski theorem for general surfaces.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

Graph minors. IV. Tree-width and well-quasi-ordering.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

Graph minors. IX. Disjoint crossed paths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

Colouring series-parallel graphs.

[BibT_eX]

[DOI]

Comb., 1990

A Separator Theorem for Graphs with an Excluded Minor and its Applications

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

On Lehman's Width-Length Characterization.

[BibT_eX]

[DOI]

Proceedings of the Polyhedral Combinatorics, 1990

Spanning Trees of Different Weights.

[BibT_eX]

[DOI]

Proceedings of the Polyhedral Combinatorics, 1990

1989

A counterexample to the rank-coloring conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 1989

Graphs with small bandwidth and cutwidth.

[BibT_eX]

[DOI]

Fan R. K. Chung

Discret. Math., 1989

1988

On the connectivity function of a matroid.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1988

Graph minors. VII. Disjoint paths on a surface.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1988

On induced subgraphs of the cube.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1988

1987

Subgraphs of large connectivity and chromatic number in graphs of large chromatic number.

[BibT_eX]

[DOI]

J. Graph Theory, 1987

Characterization of even directed graphs.

[BibT_eX]

[DOI]

Carsten Thomassen

J. Comb. Theory B, 1987

Large induced degenerate subgraphs.

[BibT_eX]

[DOI]

Jeff Kahn

Graphs Comb., 1987

The smallets n-uniform hypergraph with positive discrepancy.

[BibT_eX]

[DOI]

Comb., 1987

1986

Graph minors. VI. Disjoint paths across a disc.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1986

Graph minors. V. Excluding a planar graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1986

Graph Minors. II. Algorithmic Aspects of Tree-Width.

[BibT_eX]

[DOI]

J. Algorithms, 1986

Triples in Matroid Circuits.

[BibT_eX]

[DOI]

Eur. J. Comb., 1986

Adjacency in Binary Matroids.

[BibT_eX]

[DOI]

Eur. J. Comb., 1986

1985

Minors of 3-Connected Matroids.

[BibT_eX]

[DOI]

Eur. J. Comb., 1985

Counting points in hypercubes and convolution measure algebras.

[BibT_eX]

[DOI]

D. J. Hajela

Comb., 1985

Self-Organizing Sequential Search and Hilbert's Inequalities

[BibT_eX]

[DOI]

Fan R. K. Chung

D. J. Hajela

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984

A generalization of chordal graphs.

[BibT_eX]

[DOI]

R. W. Weaver

J. Graph Theory, 1984

Graph minors. III. Planar tree-width.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1984

A note on nongraphic matroids.

[BibT_eX]

[DOI]

Takao Asano

Takao Nishizeki

J. Comb. Theory B, 1984

1983

Graph minors. I. Excluding a forest.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1983

1982

Packing nearly-disjoint sets.

[BibT_eX]

[DOI]

Comb., 1982

1981

On Tutte's extension of the four-colour problem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1981

Multicommodity flows in planar graphs.

[BibT_eX]

[DOI]

Haruko Okamura

J. Comb. Theory B, 1981

Nowhere-zero 6-flows.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1981

Even circuits in planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1981

Matroids and Multicommodity Flows.

[BibT_eX]

[DOI]

Eur. J. Comb., 1981

On minors of non-binary matroids.

[BibT_eX]

[DOI]

Comb., 1981

Reconizing graphic matroids.

[BibT_eX]

[DOI]

Comb., 1981

1980

Four-terminus flows.

[BibT_eX]

[DOI]

Networks, 1980

Decomposition of regular matroids.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1980

Packing and covering with matroid circuits.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1980

1979

A short proof of the two-commodity flow theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1979

Matroid representation over GF(3).

[BibT_eX]

[DOI]

J. Comb. Theory B, 1979

Solution of two fractional packing problems of lovász.

[BibT_eX]

[DOI]

Discret. Math., 1979

1978

A two-commodity cut theorem.

[BibT_eX]

[DOI]

Discret. Math., 1978

Counterexample to a conjecture of Jeurissen.

[BibT_eX]

[DOI]

Discret. Math., 1978

1977

A note on the production of matroid minors.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1977

The matroids with the max-flow min-cut property.

[BibT_eX]

[DOI]