| Publication | Date of Publication | Type |
|---|
Subdivisions in dicritical digraphs with large order or digirth
(available as arXiv preprint) | N/A | Paper |
Complexity results on the decomposition of a digraph into directed linear forests and out-stars
(available as arXiv preprint) | N/A | Paper |
The 3-dicritical semi-complete digraphs
(available as arXiv preprint) | N/A | Paper |
Brooks-type colourings of digraphs in linear time
(available as arXiv preprint) | N/A | Paper |
Blow-ups and extensions of trees in tournaments
The Electronic Journal of Combinatorics | 2026-09-16 | Paper |
| An analogue of Reed's conjecture for digraphs | 2026-07-03 | Paper |
On cuts of small chromatic number in sparse graphs
Discrete Mathematics | 2026-03-12 | Paper |
On the list version of a conjecture of Erdős and Neumann-Lara
(available as arXiv preprint) | 2026-01-01 | Paper |
Increasing arc-connectivity by bounded- and fixed-size inversions
(available as arXiv preprint) | 2026-01-01 | Paper |
Coloring digraphs with Δ-b colors
(available as arXiv preprint) | 2026-01-01 | Paper |
Acyclic Dichromatic Number of Tournaments: these are the Champions
(available as arXiv preprint) | 2026-01-01 | Paper |
The directed temporal exploration problem
(available as arXiv preprint) | 2026-01-01 | Paper |
Brooks-type colourings of digraphs in linear time
Journal of Graph Theory | 2025-10-21 | Paper |
Dichromatic number of chordal graphs
Graphs and Combinatorics | 2025-08-18 | Paper |
| Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring (extended abstract) | 2025-04-15 | Paper |
The 3-dicritical semi-complete digraphs
The Electronic Journal of Combinatorics | 2025-01-29 | Paper |
On the minimum number of arcs in 4-dicritical oriented graphs
Journal of Graph Theory | 2025-01-06 | Paper |
Edge-colouring and orientations: applications to degree-boundedness and χ-boundedness
(available as arXiv preprint) | 2025-01-01 | Paper |
(Δ-1)-dicolouring of digraphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Backbone colouring of chordal graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Chromatic discrepancy of locally s-colourable graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Generalized DP-colorings of digraphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Acyclic dichromatic number of oriented graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
On the number of maximal independent sets and maximal induced bipartite subgraphs in K₄-free graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Complexity results on the decomposition of a digraph into directed linear forests and out-stars
The Electronic Journal of Combinatorics | 2024-11-09 | Paper |
Subdivisions in dicritical digraphs with large order or digirth
European Journal of Combinatorics | 2024-09-30 | Paper |
Constrained flows in networks
Theoretical Computer Science | 2024-08-20 | Paper |
Redicolouring digraphs: directed treewidth and cycle-degeneracy
Discrete Applied Mathematics | 2024-08-09 | Paper |
Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring
Journal of Graph Theory | 2024-03-25 | Paper |
Digraph redicolouring
European Journal of Combinatorics | 2024-02-05 | Paper |
An analogue of Reed's conjecture for digraphs
(available as arXiv preprint) | 2024-01-01 | Paper |
Blow-ups and extensions of trees in tournaments
(available as arXiv preprint) | 2024-01-01 | Paper |
| Minimum number of arcs in k-critical digraphs with order at most 2k-1 | 2023-10-05 | Paper |
| Constrained Flows in Networks | 2023-10-02 | Paper |
| Dichromatic number of chordal graphs | 2023-09-29 | Paper |
| Redicolouring digraphs: directed treewidth and cycle-degeneracy | 2023-07-13 | Paper |
| On the minimum number of arcs in 4-dicritical oriented graphs | 2023-06-19 | Paper |
Unbalanced spanning subgraphs in edge labeled complete graphs
The Electronic Journal of Combinatorics | 2023-03-21 | Paper |
Complexity of some arc-partition problems for digraphs
Theoretical Computer Science | 2022-10-07 | Paper |
Factorially many maximum matchings close to the Erdős-Gallai bound
The Electronic Journal of Combinatorics | 2022-07-11 | Paper |
Unbalanced spanning subgraphs in edge labeled complete graphs
(available as arXiv preprint) | 2021-07-20 | Paper |
