| Publication | Date of Publication | Type |
|---|
On the proper interval completion problem within some chordal subclasses
Discrete Mathematics | 2024-11-09 | Paper |
Tree pivot-minors and linear rank-width
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| Gap-ETH-tight approximation schemes for red-green-blue separation and bicolored noncrossing Euclidean travelling salesman tours | 2024-05-14 | Paper |
| Computing pivot-minors | 2023-11-08 | Paper |
The complexity of two colouring games
Algorithmica | 2023-04-11 | Paper |
Powers of paths in tournaments
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
| Separating the edges of a graph by a linear number of paths | 2023-01-20 | Paper |
Generalising the achromatic number to Zaslavsky's colourings of signed graphs
Theoretical Computer Science | 2022-06-13 | Paper |
On the unavoidability of oriented trees
Electronic Notes in Theoretical Computer Science | 2022-04-27 | Paper |
Tree pivot-minors and linear rank-width
SIAM Journal on Discrete Mathematics | 2022-01-07 | Paper |
Jones' conjecture in subcubic graphs
The Electronic Journal of Combinatorics | 2021-10-26 | Paper |
Generalising the achromatic number to Zaslavsky's colourings of signed graphs
arXiv preprint | 2021-09-28 | Paper |
On the unavoidability of oriented trees
Journal of Combinatorial Theory. Series B | 2021-09-16 | Paper |
Decomposing degenerate graphs into locally irregular subgraphs
Graphs and Combinatorics | 2021-03-17 | Paper |
| From light edges to strong edge-colouring of 1-planar graphs | 2020-10-28 | Paper |
Filling the complexity gaps for colouring planar and bounded degree graphs
Journal of Graph Theory | 2020-07-17 | Paper |
Complexity of planar signed graph homomorphisms to cycles
Discrete Applied Mathematics | 2020-07-07 | Paper |
Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs
Discrete Applied Mathematics | 2020-07-07 | Paper |
Partitioning sparse graphs into an independent set and a graph with bounded size components
Discrete Mathematics | 2020-06-08 | Paper |
Maximal Wiener index for graphs with prescribed number of blocks
Applied Mathematics and Computation | 2020-05-14 | Paper |
The structure of graphs with given number of blocks and the maximum Wiener index
Journal of Combinatorial Optimization | 2020-02-03 | Paper |
| 1-planar graphs with minimum degree at least 3 have bounded girth | 2020-01-15 | Paper |
Note on 3-choosability of planar graphs with maximum degree 4
Discrete Mathematics | 2019-09-11 | Paper |
Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs
Discrete Mathematics | 2019-09-11 | Paper |
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
Discrete Mathematics | 2019-02-20 | Paper |
Large induced forests in planar graphs with girth 4
Discrete Applied Mathematics | 2019-02-08 | Paper |
| Computing small pivot-minors | 2018-11-22 | Paper |
Partitioning sparse graphs into an independent set and a forest of bounded degree
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
| Colouring diamond-free graphs | 2017-10-17 | Paper |
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
European Journal of Combinatorics | 2017-09-11 | Paper |
Colouring diamond-free graphs
Journal of Computer and System Sciences | 2017-09-07 | Paper |
A lower bound on the order of the largest induced forest in planar graphs with high girth
Discrete Applied Mathematics | 2016-09-30 | Paper |
Filling the complexity gaps for colouring planar and bounded degree graphs
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Fractional triangle decompositions in graphs with large minimum degree
SIAM Journal on Discrete Mathematics | 2016-01-15 | Paper |
