2026
Dense minors of graphs with independence number two.
J. Comb. Theory B, 2026
2025
Trees and near-linear stable sets.
Comb., October, 2025
Subdivisions and near-linear stable sets.
Comb., August, 2025
Some results and problems on tournament structure.
J. Comb. Theory B, 2025
A counterexample to the coarse Menger conjecture.
J. Comb. Theory B, 2025
When all directed cycles have length three.
Eur. J. Comb., 2025
Induced subgraph density. II. Sparse and dense sets in cographs.
Eur. J. Comb., 2025
Graphs without a 3-Connected Subgraph are 4-Colourable.
Electron. J. Comb., 2025
2024
Pure Pairs. VIII. Excluding a Sparse Graph.
Comb., December, 2024
Bounded-Diameter Tree-Decompositions.
Comb., June, 2024
A Note on the Gyárfás-Sumner Conjecture.
Graphs Comb., April, 2024
Pure Pairs. IX. Transversal Trees.
SIAM J. Discret. Math., March, 2024
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs.
SIAM J. Discret. Math., March, 2024
On a problem of El-Zahar and Erdős.
J. Comb. Theory B, March, 2024
Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph.
J. Comb. Theory B, January, 2024
Induced paths in graphs without anticomplete cycles.
J. Comb. Theory B, January, 2024
Bipartite graphs with no <i>K</i><sub>6</sub> minor.
J. Comb. Theory B, January, 2024
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property.
Eur. J. Comb., January, 2024
Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph.
J. Graph Theory, 2024
Graphs with all holes the same length.
J. Comb. Theory B, 2024
Clique covers of H-free graphs.
Eur. J. Comb., 2024
2023
Polynomial bounds for chromatic number VII. Disjoint holes.
J. Graph Theory, November, 2023
Strengthening Rödl's theorem.
J. Comb. Theory B, November, 2023
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path.
Comb., October, 2023
Proof of a conjecture of Plummer and Zha.
J. Graph Theory, July, 2023
Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix.
J. Comb. Theory B, July, 2023
Pure pairs. IV. Trees in bipartite graphs.
J. Comb. Theory B, July, 2023
Even-hole-free graphs still have bisimplicial vertices.
J. Comb. Theory B, July, 2023
Pure Pairs. V. Excluding Some Long Subdivision.
Comb., June, 2023
Polynomial bounds for chromatic number VI. Adding a four-vertex path.
Eur. J. Comb., May, 2023
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree.
J. Graph Theory, 2023
Cops and robbers on P<sub>5</sub>-free graphs.
CoRR, 2023
2022
Pure Pairs VI: Excluding an Ordered Tree.
SIAM J. Discret. Math., 2022
Polynomial bounds for chromatic number. III. Excluding a double star.
J. Graph Theory, 2022
Polynomial bounds for chromatic number II: Excluding a star-forest.
J. Graph Theory, 2022
Detecting a long even hole.
Eur. J. Comb., 2022
Concatenating Bipartite Graphs.
Electron. J. Comb., 2022
2021
Finding a Shortest Odd Hole.
ACM Trans. Algorithms, 2021
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings.
J. Comb. Theory B, 2021
Erdős-Hajnal for cap-free graphs.
J. Comb. Theory B, 2021
A note on simplicial cliques.
Discret. Math., 2021
New examples of minimal non-strongly-perfect graphs.
Discret. Math., 2021
Finding an induced path that is not a shortest path.
Discret. Math., 2021
Pure Pairs. II. Excluding All Subdivisions of A Graph.
Comb., 2021
Detecting a Long Odd Hole.
Comb., 2021
Induced subgraphs of bounded treewidth and the container method.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
2020
A survey of χ-boundedness.
J. Graph Theory, 2020
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs.
J. Graph Theory, 2020
Induced subgraphs of graphs with large chromatic number. VI. Banana trees.
J. Comb. Theory B, 2020
Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture.
J. Comb. Theory B, 2020
Corrigendum to "Bisimplicial vertices in even-hole-free graphs".
J. Comb. Theory B, 2020
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes.
J. Comb. Theory, Ser. B, 2020
Induced subgraphs of graphs with large chromatic number. XIII. New brooms.
Eur. J. Comb., 2020
Excluding the fork and antifork.
Discret. Math., 2020
Short Directed Cycles in Bipartite Digraphs.
Comb., 2020
2019
Bad news for chordal partitions.
J. Graph Theory, 2019
Induced subgraphs of graphs with large chromatic number. XII. Distant stars.
J. Graph Theory, 2019
Excluded minors in cubic graphs.
J. Comb. Theory B, 2019
Near-domination in graphs.
J. Comb. Theory A, 2019
Caterpillars in Erdős-Hajnal.
J. Comb. Theory B, 2019
Disjoint paths in unions of tournaments.
J. Comb. Theory 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
H-colouring Pt-free graphs in subexponential time.
Discret. Appl. Math., 2019
Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue.
Comb., 2019
Girth Six Cubic Graphs Have Petersen Minors.
Comb., 2019
Clustered Colouring in Minor-Closed Classes.
Comb., 2019
Towards Erdős-Hajnal for Graphs with No 5-Hole.
Comb., 2019
2018
Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes.
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].
J. Comb. Theory B, 2018
Even pairs and prism corners in square-free Berge graphs.
J. Comb. Theory B, 2018
Domination in tournaments.
J. Comb. Theory B, 2018
Triangle-free graphs with no six-vertex induced path.
Discret. Math., 2018
2017
Cyclically five-connected cubic graphs.
J. Comb. Theory B, 2017
Colouring perfect graphs with bounded clique number.
J. Comb. Theory B, 2017
Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths.
Electron. J. Comb., 2017
Majority Colourings of Digraphs.
Electron. J. Comb., 2017
Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes.
Comb., 2017
2016
Induced subgraphs of graphs with large chromatic number. I. Odd holes.
J. Comb. Theory B, 2016
Three-edge-colouring doublecross cubic graphs.
J. Comb. Theory B, 2016
Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures.
J. Comb. Theory B, 2016
Unavoidable induced subgraphs in large graphs with no homogeneous sets.
J. Comb. Theory B, 2016
Immersion in four-edge-connected graphs.
J. Comb. Theory B, 2016
Proceedings of the Open Problems in Mathematics., 2016
2015
A Relative of Hadwiger's Conjecture.
SIAM J. Discret. Math., 2015
Excluding a Substar and an Antisubstar.
SIAM J. Discret. Math., 2015
Criticality for multicommodity flows.
J. Comb. Theory B, 2015
Tree-width and planar minors.
J. Comb. Theory B, 2015
Edge-disjoint paths in digraphs with bounded independence number.
J. Comb. Theory B, 2015
Edge-colouring eight-regular planar graphs.
J. Comb. Theory B, 2015
Edge-colouring seven-regular planar graphs.
J. Comb. Theory B, 2015
Wheel-free planar graphs.
Eur. J. Comb., 2015
Excluding A Grid Minor In Planar Digraphs.
CoRR, 2015
Excluding paths and antipaths.
Comb., 2015
2014
Excluding pairs of graphs.
J. Comb. Theory B, 2014
Rao's degree sequence conjecture.
J. Comb. Theory B, 2014
Extending the Gyárfás-Sumner conjecture.
J. Comb. Theory B, 2014
Tournaments with near-linear transitive subsets.
J. Comb. Theory B, 2014
Proof of a conjecture of Bowlin and Brin on four-colouring triangulations.
Eur. J. Comb., 2014
Reducibility in the Four-Color Theorem.
CoRR, 2014
2013
A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs.
SIAM J. Discret. Math., 2013
A counterexample to a conjecture of Schwartz.
Soc. Choice Welf., 2013
Tournament pathwidth and topological containment.
J. Comb. Theory B, 2013
Detecting an induced net subdivision.
J. Comb. Theory B, 2013
Tournaments and colouring.
J. Comb. Theory B, 2013
2012
SIAM J. Discret. Math., 2012
Graph Minors. XXII. Irrelevant vertices in linkage problems.
J. Comb. Theory B, 2012
Claw-free graphs. VII. Quasi-line graphs.
J. Comb. Theory B, 2012
Three-colourable perfect graphs without even pairs.
J. Comb. Theory B, 2012
Tournament immersion and cutwidth.
J. Comb. Theory B, 2012
Perfect matchings in planar cubic graphs.
Comb., 2012
Finding minimum clique capacity.
Comb., 2012
2011
A well-quasi-order for tournaments.
J. Comb. Theory B, 2011
The edge-density for K<sub>2, t</sub> minors.
J. Comb. Theory B, 2011
A local strengthening of Reed's ω, Δ, χ conjecture for quasi-line graphs
CoRR, 2011
2010
Graph minors XXIII. Nash-Williams' immersion conjecture.
J. Comb. Theory B, 2010
Claw-free graphs VI. Colouring.
J. Comb. Theory B, 2010
K<sub>4</sub>-free graphs with no odd holes.
J. Comb. Theory B, 2010
Counting paths in digraphs.
Eur. J. Comb., 2010
The three-in-a-tree problem.
Comb., 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
2009
Graph minors. XXI. Graphs with unique linkages.
J. Comb. Theory B, 2009
On the odd-minor variant of Hadwiger's conjecture.
J. Comb. Theory B, 2009
Even pairs in Berge graphs.
J. Comb. Theory B, 2009
2008
Claw-free graphs. V. Global structure.
J. Comb. Theory B, 2008
Claw-free graphs. IV. Decomposition theorem.
J. Comb. Theory B, 2008
Claw-free graphs. III. Circular interval graphs.
J. Comb. Theory B, 2008
Claw-free graphs. II. Non-orientable prismatic graphs.
J. Comb. Theory B, 2008
Solution of three problems of Cornuéjols.
J. Comb. Theory B, 2008
Bisimplicial vertices in even-hole-free graphs.
J. Comb. Theory B, 2008
Cycles in dense digraphs.
Comb., 2008
2007
Claw-free graphs. I. Orientable prismatic graphs.
J. Comb. Theory B, 2007
The roots of the independence polynomial of a clawfree graph.
J. Comb. Theory B, 2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
2006
Approximating clique-width and branch-width.
J. Comb. Theory B, 2006
Proper minor-closed families are small.
J. Comb. Theory B, 2006
Disjoint paths in graphs.
Discret. Math., 2006
Packing Non-Zero A-Paths In Group-Labelled Graphs.
Comb., 2006
Certifying large branch-width.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
2005
Recognizing Berge Graphs.
Comb., 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 B, 2004
Graph Minors. XX. Wagner's conjecture.
J. Comb. Theory B, 2004
Excluding any graph as a minor allows a low tree-width 2-coloring.
J. Comb. Theory 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 B, 2003
Graph Minors. XVI. Excluding a non-planar graph.
J. Comb. Theory B, 2003
Extending partial 3-colourings in a planar graph.
J. Comb. Theory B, 2003
Tour Merging via Branch-Decomposition.
INFORMS J. Comput., 2003
2002
Coloring Locally Bipartite Graphs on Surfaces.
J. Comb. Theory B, 2002
Colouring Eulerian Triangulations.
J. Comb. Theory B, 2002
2001
Spanning trees with many leaves.
J. Graph Theory, 2001
Node Placement and Sizing for Copper Broadband Access Networks.
Ann. Oper. Res., 2001
2000
Long cycles in critical graphs.
J. Graph Theory, 2000
1999
Graph Minors: XVII. Taming a Vortex.
J. Comb. Theory B, 1999
1998
The Ring Loading Problem.
SIAM J. Discret. Math., 1998
A Petersen on a Pentagon.
J. Comb. Theory B, 1998
A Note on List Arboricity.
J. Comb. Theory B, 1998
Fractional Colouring and Hadwiger's Conjecture.
J. Comb. Theory 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 B, 1997
Tutte's Edge-Colouring Conjecture.
J. Comb. Theory 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.
J. 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.
Comb., 1996
Packing Directed Circuits.
Comb., 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 B, 1995
Graph Minors .XIII. The Disjoint Paths Problem.
J. Comb. Theory B, 1995
Graph Minors .XII. Distance on a Surface.
J. Comb. Theory B, 1995
Graph Minors .XIV. Extending an Embedding.
J. Comb. Theory B, 1995
Packing Directed Circuits Fractionally.
Comb., 1995
1994
SIAM J. Discret. Math., 1994
The Complexity of Multiterminal Cuts.
SIAM J. Comput., 1994
A Note on Hyperplane Generation.
J. Comb. Theory B, 1994
Quickly Excluding a Planar Graph.
J. Comb. Theory B, 1994
Graph Minors. XI. Circuits on a Surface.
J. Comb. Theory B, 1994
Circular embeddings of planar graphs in nonspherical surfaces.
Discret. Math., 1994
Call Routing and the Ratcatcher.
Comb., 1994
Bounding the Vertex Cover Number of a Hypergraph.
Comb., 1994
1993
Graph Searching and a Min-Max Theorem for Tree-Width.
J. Comb. Theory B, 1993
Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle.
J. Comb. Theory B, 1993
Hadwiger's conjecture for K <sub>6</sub>-free graphs.
Comb., 1993
On the fractional matching polytope of a hypergraph.
Comb., 1993
1992
Disjoint Paths in a Planar Graph - A General Theorem.
SIAM J. Discret. Math., 1992
On secret-sharing matroids.
J. Comb. Theory B, 1992
Directed triangles in directed graphs.
Discret. Math., 1992
A fractional version of the Erdös-Faber-Lovász conjecture.
Comb., 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 A, 1991
Graph minors. X. Obstructions to tree-decomposition.
J. Comb. Theory B, 1991
Quickly excluding a forest.
J. Comb. Theory B, 1991
Monotonicity in Graph Searching.
J. Algorithms, 1991
An end-faithful spanning tree counterexample.
Discret. Math., 1991
Excluding infinite minors.
Discret. Math., 1991
Directed circuits on a torus.
Comb., 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.
J. Graph Theory, 1990
Graph minors. VIII. A kuratowski theorem for general surfaces.
J. Comb. Theory B, 1990
Graph minors. IV. Tree-width and well-quasi-ordering.
J. Comb. Theory B, 1990
Graph minors. IX. Disjoint crossed paths.
J. Comb. Theory B, 1990
Colouring series-parallel graphs.
Comb., 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.
J. Graph Theory, 1989
Graphs with small bandwidth and cutwidth.
Discret. Math., 1989
1988
On the connectivity function of a matroid.
J. Comb. Theory B, 1988
Graph minors. VII. Disjoint paths on a surface.
J. Comb. Theory B, 1988
On induced subgraphs of the cube.
J. Comb. Theory A, 1988
1987
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number.
J. Graph Theory, 1987
Characterization of even directed graphs.
J. Comb. Theory B, 1987
Large induced degenerate subgraphs.
Graphs Comb., 1987
The smallets n-uniform hypergraph with positive discrepancy.
Comb., 1987
1986
Graph minors. VI. Disjoint paths across a disc.
J. Comb. Theory B, 1986
Graph minors. V. Excluding a planar graph.
J. Comb. Theory 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.
Comb., 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.
J. Graph Theory, 1984
Graph minors. III. Planar tree-width.
J. Comb. Theory B, 1984
A note on nongraphic matroids.
J. Comb. Theory B, 1984
1983
Graph minors. I. Excluding a forest.
J. Comb. Theory B, 1983
1982
Packing nearly-disjoint sets.
Comb., 1982
1981
On Tutte's extension of the four-colour problem.
J. Comb. Theory B, 1981
Multicommodity flows in planar graphs.
J. Comb. Theory B, 1981
Even circuits in planar graphs.
J. Comb. Theory B, 1981
Matroids and Multicommodity Flows.
Eur. J. Comb., 1981
On minors of non-binary matroids.
Comb., 1981
Reconizing graphic matroids.
Comb., 1981
1980
Decomposition of regular matroids.
J. Comb. Theory B, 1980
Packing and covering with matroid circuits.
J. Comb. Theory B, 1980
1979
A short proof of the two-commodity flow theorem.
J. Comb. Theory B, 1979
Matroid representation over GF(3).
J. Comb. Theory B, 1979
Solution of two fractional packing problems of lovász.
Discret. Math., 1979
1978
A two-commodity cut theorem.
Discret. Math., 1978
Counterexample to a conjecture of Jeurissen.
Discret. Math., 1978
1977
A note on the production of matroid minors.
J. Comb. Theory B, 1977
The matroids with the max-flow min-cut property.
J. Comb. Theory B, 1977
