2024
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations.
J. Comb. Theory, Ser. B, January, 2024
2023
Packing cycles in undirected group-labelled graphs.
J. Comb. Theory, Ser. B, July, 2023
Packing <i>A</i>-paths of length zero modulo a prime.
J. Comb. Theory, Ser. B, May, 2023
Properties of 8-contraction-critical graphs with no K7 minor.
Eur. J. Comb., May, 2023
J. Comb. Theory, Ser. B, 2023
2022
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm.
J. Comb. Theory, Ser. B, 2022
2021
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs.
J. Comb. Theory, Ser. B, 2021
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies.
J. Comb. Theory, Ser. B, 2021
2020
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five.
J. Comb. Theory, Ser. B, 2020
Quickly excluding a non-planar graph.
CoRR, 2020
2019
Excluded minors in cubic graphs.
J. Comb. Theory, Ser. B, 2019
Excluding subdivisions of bounded degree graphs.
J. Comb. Theory, Ser. B, 2019
<i>K</i><sub>6</sub> minors in 6-connected graphs of bounded tree-width.
J. Comb. Theory, Ser. B, 2019
The extremal functions for triangle-free graphs with excluded minors.
Eur. J. Comb., 2019
Girth Six Cubic Graphs Have Petersen Minors.
Comb., 2019
The Extremal Function for Bipartite Linklessly Embeddable Graphs.
Comb., 2019
2018
Four Edge-Independent Spanning Trees.
SIAM J. Discret. Math., 2018
Five-list-coloring graphs on surfaces III. One list of size one and one list of size two.
J. Comb. Theory, Ser. B, 2018
A new proof of the flat wall theorem.
J. Comb. Theory, Ser. B, 2018
<i>K</i><sub>6</sub> minors in large 6-connected graphs.
J. Comb. Theory, Ser. B, 2018
Non-embeddable extensions of embedded minors.
J. Comb. Theory, Ser. B, 2018
Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk.
J. Comb. Theory, Ser. B, 2018
2017
Cyclically five-connected cubic graphs.
J. Comb. Theory, Ser. B, 2017
Minors of two-connected graphs of large path-width.
CoRR, 2017
2016
Deploying Robots With Two Sensors in <i>K</i><sub>1, 6</sub>-Free Graphs.
J. Graph Theory, 2016
Odd K<sub>3, 3</sub> subdivisions in bipartite graphs.
J. Comb. Theory, Ser. B, 2016
Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk.
J. Comb. Theory, Ser. B, 2016
Non-planar extensions of subdivisions of planar graphs.
J. Comb. Theory, Ser. B, 2016
Three-edge-colouring doublecross cubic graphs.
J. Comb. Theory, Ser. B, 2016
Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle.
J. Comb. Theory, Ser. B, 2016
Hyperbolic families and coloring graphs on surfaces.
CoRR, 2016
2015
Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs.
J. Comb. Theory, Ser. B, 2015
Excluding A Grid Minor In Planar Digraphs.
CoRR, 2015
2014
Reducibility in the Four-Color Theorem.
CoRR, 2014
List-coloring apex-minor-free graphs.
CoRR, 2014
2013
Sub-exponentially many 3-colorings of triangle-free planar graphs.
J. Comb. Theory, Ser. B, 2013
Testing first-order properties for subclasses of sparse graphs.
J. ACM, 2013
Odd K_3, 3 subdivisions in bipartite graphs.
CoRR, 2013
Arrangeability and Clique Subdivisions.
Proceedings of the Mathematics of Paul Erdős II, 2013
2012
Nested cycles in large triangulations and crossing-critical graphs.
J. Comb. Theory, Ser. B, 2012
Five-coloring graphs on the Klein bottle.
J. Comb. Theory, Ser. B, 2012
K_6 minors in large 6-connected graphs
CoRR, 2012
K_6 minors in 6-connected graphs of bounded tree-width
CoRR, 2012
2011
Three-coloring triangle-free planar graphs in linear time.
ACM Trans. Algorithms, 2011
Large non-planar graphs and an application to crossing-critical graphs.
J. Comb. Theory, Ser. B, 2011
Minor-minimal non-projective planar graphs with an internal 3-separation.
Electron. Notes Discret. Math., 2011
Minor-Minimal Planar Graphs of Even Branch-Width.
Comb. Probab. Comput., 2011
Edge-coloring series-parallel multigraphs
CoRR, 2011
Packing directed circuits exactly.
Comb., 2011
2010
Voting in Agreeable Societies.
Am. Math. Mon., 2010
K<sub>4</sub>-free graphs with no odd holes.
J. Comb. Theory, Ser. B, 2010
Deciding First-Order Properties for Sparse Graphs.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
2009
Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs.
Electron. Notes Discret. Math., 2009
<i>K</i><sub><i>t</i></sub> Minors in Large <i>t</i>-Connected Graphs.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009
2008
The extremal function for 3-linked graphs.
J. Comb. Theory, Ser. B, 2008
Minimally non-Pfaffian graphs.
J. Comb. Theory, Ser. B, 2008
Six-Critical Graphs on the Klein Bottle.
Electron. Notes Discret. Math., 2008
Pfaffian labelings and signs of edge colorings.
Comb., 2008
Coloring even-faced graphs in the torus and the Klein bottle.
Comb., 2008
2007
J. Comb. Theory, Ser. B, 2007
Coloring Triangle-Free Graphs on Surfaces.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007
2006
The extremal function for <i>K</i><sub>9</sub> minors.
J. Comb. Theory, Ser. B, 2006
J. Comb. Theory, Ser. B, 2006
Proper minor-closed families are small.
J. Comb. Theory, Ser. B, 2006
Independent sets in triangle-free cubic planar graphs.
J. Comb. Theory, Ser. B, 2006
The Circular Chromatic Index of Flower Snarks.
Electron. J. Comb., 2006
2005
Hamilton paths in toroidal graphs.
J. Comb. Theory, Ser. B, 2005
An improved linear edge bound for graph linkages.
Eur. J. Comb., 2005
Generation of simple quadrangulations of the sphere.
Discret. Math., 2005
2004
On possible counterexamples to Negami's planar cover conjecture.
J. Graph Theory, 2004
Three-coloring Klein bottle graphs of girth five.
J. Comb. Theory, Ser. B, 2004
2003
Progress on perfect graphs.
Math. Program., 2003
Temperely-Lieb Algebras and the Four-Color Theorem.
Comb., 2003
2002
Generating Internally Four-Connected Graphs.
J. Comb. Theory, Ser. B, 2002
2001
Large induced forests in sparse graphs.
J. Graph Theory, 2001
J. Comb. Theory, Ser. B, 2001
A new proof of the independence ratio of triangle-free cubic graphs.
Discret. Math., 2001
2000
Clique Minors in Graphs and Their Complements.
J. Comb. Theory, Ser. B, 2000
Excluding Minors In Nonplanar Graphs Of Girth At Least Five.
Comb. Probab. Comput., 2000
Digraph minors and algorithms (abstract only).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
1999
Excluding a Countable Clique.
J. Comb. Theory, Ser. B, 1999
List Edge-Colorings of Series-Parallel Graphs.
Electron. J. Comb., 1999
Graph Planarity and Related Topics.
Proceedings of the Graph Drawing, 7th International Symposium, 1999
1997
Five-Connected Toroidal Graphs Are Hamiltonian.
J. Comb. Theory, Ser. B, 1997
Tutte's Edge-Colouring Conjecture.
J. Comb. Theory, Ser. B, 1997
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.
J. Graph Theory, 1996
Spanning paths in infinite planar graphs.
J. Graph Theory, 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
On the Genus of a Random Graph.
Random Struct. Algorithms, 1995
Sachs' Linkless Embedding Conjecture.
J. Comb. Theory, Ser. B, 1995
J. Comb. Theory, Ser. B, 1995
J. Comb. Theory, Ser. B, 1995
1994
SIAM J. Discret. Math., 1994
4-Connected Projective-Planar Graphs Are Hamiltonian.
J. Comb. Theory, Ser. B, 1994
Quickly Excluding a Planar Graph.
J. Comb. Theory, Ser. B, 1994
Call Routing and the Ratcatcher.
Comb., 1994
1993
Graph Searching and a Min-Max Theorem for Tree-Width.
J. Comb. Theory, Ser. B, 1993
Typical Subgraphs of 3- and 4-Connected Graphs.
J. Comb. Theory, Ser. B, 1993
Hadwiger's conjecture for K <sub>6</sub>-free graphs.
Comb., 1993
1992
Monochromatic Vs multicolored paths.
Graphs Comb., 1992
On the complexity of finding iso- and other morphisms for partial k-trees.
Discret. Math., 1992
1991
On the orientable genus of graphs embedded in the klein bottle.
J. Graph Theory, 1991
The menger-like property of the tree-width of infinite graphs.
J. Comb. Theory, Ser. B, 1991
Quickly excluding a forest.
J. Comb. Theory, Ser. B, 1991
Algorithms Finding Tree-Decompositions of Graphs.
J. Algorithms, 1991
An end-faithful spanning tree counterexample.
Discret. Math., 1991
Excluding infinite minors.
Discret. Math., 1991
Analyzing Nash-Williams' partition theorem by means of ordinal types.
Discret. Math., 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
1990
A menger-like property of tree-width: The finite case.
J. Comb. Theory, Ser. B, 1990
On well-quasi-ordering finite structures with labels.
Graphs Comb., 1990
Clique-sums, tree-decompositions and compactness.
Discret. Math., 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
1985
Graphs without <i>K</i><sub>4</sub> and well-quasi-ordering.
J. Comb. Theory, Ser. B, 1985
