| Publication | Date of Publication | Type |
|---|
Orientations of cycles in digraphs of high chromatic number and high minimum out-degree
Combinatorica | 2026-03-20 | Paper |
Beyond the pseudoforest strong nine dragon tree theorem
European Journal of Combinatorics | 2025-09-16 | Paper |
Precoloring extension in planar near-Eulerian-triangulations
European Journal of Combinatorics | 2025-08-08 | Paper |
Precoloring extension in planar near-Eulerian-triangulations
European Journal of Combinatorics | 2025-06-02 | Paper |
| Precoloring extension in planar near-Eulerian-triangulations (extended abstract) | 2025-04-08 | Paper |
The overfull nine dragon tree conjecture is true
Innovations in Graph Theory | 2025-03-05 | Paper |
Subchromatic numbers of powers of graphs with excluded minors
Discrete Mathematics | 2025-02-11 | Paper |
On heroes in digraphs with forbidden induced forests
European Journal of Combinatorics | 2025-01-16 | Paper |
The strong nine dragon tree conjecture is true for d k + 1
Combinatorica | 2024-01-25 | Paper |
| Precoloring extension in planar near-Eulerian-triangulations | 2023-12-20 | Paper |
A density bound for triangle‐free 4‐critical graphs
Journal of Graph Theory | 2023-10-09 | Paper |
Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$
Journal of Graph Theory | 2023-10-06 | Paper |
| Beyond the Pseudoforest Strong Nine Dragon Tree Theorem | 2023-10-02 | Paper |
Local Hadwiger's conjecture
Journal of Combinatorial Theory. Series B | 2023-08-10 | Paper |
| On heroes in digraphs with forbidden induced forests | 2023-06-07 | Paper |
Recoloring Planar Graphs of Girth at Least Five
SIAM Journal on Discrete Mathematics | 2023-03-30 | Paper |
| Decompositions into two linear forests of bounded lengths | 2023-01-27 | Paper |
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number
Journal of Combinatorial Theory. Series B | 2022-11-28 | Paper |
Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded
The Electronic Journal of Combinatorics | 2022-11-08 | Paper |
| The Strong Nine Dragon Tree Conjecture is true for d \leq k+1 | 2022-08-12 | Paper |
| Square roots of nearly planar graphs | 2022-05-25 | Paper |
Cycles in color-critical graphs
The Electronic Journal of Combinatorics | 2022-04-04 | Paper |
Graph homomorphism reconfiguration and frozen \(H\)-colorings
Journal of Graph Theory | 2022-03-31 | Paper |
Recolouring planar graphs of girth at least five
(available as arXiv preprint) | 2021-12-01 | Paper |
Graph minors and the linear reducibility of Feynman diagrams
Advances in Theoretical and Mathematical Physics | 2021-11-24 | Paper |
Reconfiguration of graph minors
(available as arXiv preprint) | 2021-08-04 | Paper |
The pseudoforest analogue for the strong nine dragon tree conjecture is true
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
| Sparse $4$-critical graphs have low circular chromatic number | 2020-07-30 | Paper |
Reconfiguring spanning and induced subgraphs
Theoretical Computer Science | 2020-01-16 | Paper |
| An Approximate Version of the Strong Nine Dragon Tree Conjecture | 2019-09-17 | Paper |
| On Decomposing Graphs Into Forests and Pseudoforests | 2019-04-28 | Paper |
Reconfiguring spanning and induced subgraphs
Lecture Notes in Computer Science | 2018-10-04 | Paper |
Reconfiguration of graph minors
(available as arXiv preprint) | 2018-04-24 | Paper |
| On the structure of graphs excluding $K_{4}$, $W_{4}$, $K_{2,4}$ and one other graph as a rooted minor | 2017-08-11 | Paper |
Graph Minors and the Linear Reducibility of Feynman Diagrams
(available as arXiv preprint) | 2017-08-04 | Paper |
| Rooted Graph Minors and Reducibility of Graph Polynomials | 2017-04-15 | Paper |
A dichotomy theorem for circular colouring reconfiguration
Theoretical Computer Science | 2016-06-30 | Paper |
Subchromatic numbers of powers of graphs with excluded minors
(available as arXiv preprint) | N/A | Paper |
The Strong Nine Dragon Tree Conjecture is True for $d \leq 2(k+1)$
(available as arXiv preprint) | N/A | Paper |
