| Publication | Date of Publication | Type |
|---|
Asymptotically Optimal Proper Conflict-Free Colouring
(available as arXiv preprint) | N/A | Paper |
Peaceful Colourings
(available as arXiv preprint) | N/A | Paper |
Linear bounds on treewidth in terms of excluded planar minors
(available as arXiv preprint) | N/A | Paper |
Vertex Ranking of Degenerate Graphs
(available as arXiv preprint) | N/A | Paper |
Linear bounds on treewidth in terms of excluded planar minors
The Electronic Journal of Combinatorics | 2026-02-04 | Paper |
Embedding nearly spanning trees
Combinatorics, Probability and Computing | 2025-12-30 | Paper |
Graphs of minimum degree at least d2 and large enough maximum degree embed every tree with d vertices
Procedia Computer Science | 2025-12-11 | Paper |
The speed and threshold of the biased Hamilton cycle game
Procedia Computer Science | 2025-12-02 | Paper |
The speed and threshold of the biased perfect matching game
Procedia Computer Science | 2025-12-02 | Paper |
Partitioning into prescribed number of cycles and Mod k T-join with slack
Procedia Computer Science | 2025-12-02 | Paper |
| How to determine if a random graph with a fixed degree sequence has a giant component | 2025-08-06 | Paper |
Peaceful colourings
Bulletin of the Institute of Mathematics. Academia Sinica. New Series | 2025-08-05 | Paper |
Asymptotically optimal proper conflict-free coloring
Random Structures & Algorithms | 2025-05-06 | Paper |
| A separator theorem in minor-closed classes | 2025-04-29 | Paper |
Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result
Journal of Graph Theory | 2023-10-09 | Paper |
Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result
Journal of Graph Theory | 2023-10-09 | Paper |
Notes on tree- and path-chromatic number
(available as arXiv preprint) | 2021-12-10 | Paper |
Tight bounds on the clique chromatic number
The Electronic Journal of Combinatorics | 2021-09-28 | Paper |
Cops and robbers on oriented toroidal grids
Theoretical Computer Science | 2021-01-25 | Paper |
Tight Bounds on the Clique Chromatic Number
(available as arXiv preprint) | 2020-06-19 | Paper |
A lower bound on the average degree forcing a minor
The Electronic Journal of Combinatorics | 2020-06-15 | Paper |
A variant of the Erdős-Sós conjecture
Journal of Graph Theory | 2020-05-21 | Paper |
Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs''
Journal of Combinatorial Theory. Series B | 2020-04-07 | Paper |
Notes on growing a tree in a graph
Random Structures & Algorithms | 2019-11-07 | Paper |
Near-domination in graphs
Journal of Combinatorial Theory. Series A | 2019-06-25 | Paper |
A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory–
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Asymptotically optimal frugal colouring | 2019-05-06 | Paper |
| A nearly linear time algorithm for the half integral parity disjoint paths packing problem | 2019-05-06 | Paper |
| A logarithmic bound for the chromatic number of the associahedron | 2018-11-21 | Paper |
Polyhedral results on the stable set problem in graphs containing even or odd pairs
Mathematical Programming. Series A. Series B | 2018-09-28 | Paper |
How to determine if a random graph with a fixed degree sequence has a giant component
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2018-02-12 | Paper |
How to determine if a random graph with a fixed degree sequence has a giant component
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2018-02-12 | Paper |
Colourings with Bounded Monochromatic Components in Graphs of Given Circumference
(available as arXiv preprint) | 2017-12-06 | Paper |
| Colourings with Bounded Monochromatic Components in Graphs of Given Circumference | 2017-12-06 | Paper |
Forcing a sparse minor
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Corrigendum: ``Forcing a sparse minor''
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Existence of spanning \(\mathcal{F}\)-free subgraphs with large minimum degree
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
| Building your path to escape from home | 2017-09-29 | Paper |
Acyclic edge colourings of graphs with large girth
Random Structures & Algorithms | 2017-08-10 | Paper |
Acyclic edge colourings of graphs with large girth
Random Structures & Algorithms | 2017-08-10 | Paper |
| k-colouring when k is close to | 2016-07-01 | Paper |
A short proof that can be bounded away from + 1 toward
Journal of Graph Theory | 2016-02-01 | Paper |
The height of a random binary search tree
Journal of the ACM | 2015-11-12 | Paper |
| Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time | 2015-09-25 | Paper |
A proof of a conjecture of Ohba
Journal of Graph Theory | 2015-05-22 | Paper |
A proof of a conjecture of Ohba
Journal of Graph Theory | 2015-05-22 | Paper |
Excluding a substar and an antisubstar
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
An improved algorithm for finding tree decompositions of small width
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Claw-free graphs, skeletal graphs, and a stronger conjecture on , , and
Journal of Graph Theory | 2015-03-24 | Paper |
Colouring graphs when the number of colours is nearly the maximum degree
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Hadwiger's conjecture is decidable
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
A linear-time algorithm to find a separator in a graph excluding a minor
ACM Transactions on Algorithms | 2014-11-18 | Paper |
For most graphs H, most H-free graphs have a linear homogeneous set
Random Structures & Algorithms | 2014-11-17 | Paper |
Colouring graphs when the number of colours is almost the maximum degree
Journal of Combinatorial Theory. Series B | 2014-10-22 | Paper |
| A Density Version of the Corradi-Hajnal Theorem | 2014-10-01 | Paper |
How tall is a tree?
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Removable paths and cycles with parity constraints
Journal of Combinatorial Theory. Series B | 2014-08-28 | Paper |
Odd cycle packing
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
The Graph Minor Algorithm with Parity Conditions
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
| Recognizing a totally odd \(K_{4}\)-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements | 2014-05-22 | Paper |
| scientific article; zbMATH DE number 6297714 (Why is no real title available?) | 2014-05-22 | Paper |
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Fractionally edge colouring graphs with large maximum degree in linear time
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
A general critical condition for the emergence of a giant component in random graphs with given degrees
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Digraph girth via chromatic number
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
Asymptotics of the chromatic number for quasi-line graphs
Journal of Graph Theory | 2013-07-31 | Paper |
A characterization of graphs with fractional total chromatic number equal to \(\Delta +2\)
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Oriented trees in digraphs
Discrete Mathematics | 2013-04-15 | Paper |
Connectivity for Bridge-addable monotone graph classes
Combinatorics, Probability and Computing | 2012-10-31 | Paper |
Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
Polynomial-time recognition of clique-width 3 graphs
Discrete Applied Mathematics | 2012-05-11 | Paper |
The disjoint paths problem in quadratic time
Journal of Combinatorial Theory. Series B | 2012-05-04 | Paper |
Polynomial treewidth forces a large grid-like-minor
European Journal of Combinatorics | 2012-02-11 | Paper |
| Almost all H-free graphs have the Erdős-Hajnal property | 2011-02-18 | Paper |
The edge-density for \(K_{2,t}\) minors
Journal of Combinatorial Theory. Series B | 2011-01-14 | Paper |
Critical random graphs and the structure of a minimum spanning tree
Random Structures & Algorithms | 2010-11-09 | Paper |
Highly parity linked graphs
Combinatorica | 2010-08-13 | Paper |
| scientific article; zbMATH DE number 5764892 (Why is no real title available?) | 2010-08-06 | Paper |
| scientific article; zbMATH DE number 5764899 (Why is no real title available?) | 2010-08-06 | Paper |
| Fast separation in a graph with an excluded minor | 2010-07-30 | Paper |
| An upper bound for the chromatic number of line graphs | 2010-07-30 | Paper |
| scientific article; zbMATH DE number 5730481 (Why is no real title available?) | 2010-07-05 | Paper |
Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph
Discrete Applied Mathematics | 2010-05-25 | Paper |
Tree-width of graphs without a \(3\times 3\) grid minor
Discrete Applied Mathematics | 2010-04-28 | Paper |
Asymptotically optimal frugal colouring
Journal of Combinatorial Theory. Series B | 2010-04-21 | Paper |
Corrigendum to ``Asymptotically optimal frugal colouring'' [J. Comb. Theory, Ser. B 100, No. 2, 226--246 (2010)]
Journal of Combinatorial Theory. Series B | 2010-04-21 | Paper |
Minima in branching random walks
The Annals of Probability | 2009-07-28 | Paper |
Coloring Artemis graphs
Theoretical Computer Science | 2009-05-28 | Paper |
On Planar Quasi-Parity Graphs
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
Bounding χ in terms of ω and Δ for quasi-line graphs
Journal of Graph Theory | 2009-02-20 | Paper |
Properly 2-Colouring Linear Hypergraphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
On the odd-minor variant of Hadwiger's conjecture
Journal of Combinatorial Theory. Series B | 2009-01-21 | Paper |
Removable cycles in non-bipartite graphs
Journal of Combinatorial Theory. Series B | 2009-01-21 | Paper |
Fast Skew Partition Recognition
Computational Geometry and Graph Theory | 2009-01-13 | Paper |
Domination in Cubic Graphs of Large Girth
Computational Geometry and Graph Theory | 2009-01-13 | Paper |
| scientific article; zbMATH DE number 5485473 (Why is no real title available?) | 2009-01-05 | Paper |
Bisimplicial vertices in even-hole-free graphs
Journal of Combinatorial Theory. Series B | 2008-12-08 | Paper |
A weaker version of Lovász' path removal conjecture
Journal of Combinatorial Theory. Series B | 2008-10-07 | Paper |
On the Maximum Degree of a Random Planar Graph
Combinatorics, Probability and Computing | 2008-09-29 | Paper |
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Discrete Applied Mathematics | 2008-09-29 | Paper |
The evolution of the mixing rate of a simple random walk on the giant component of a random graph
Random Structures & Algorithms | 2008-09-04 | Paper |
| Ballot theorems, old and new | 2008-07-01 | Paper |
List Colouring Squares of Planar Graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
List Colouring Constants of Triangle Free Graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
