| Publication | Date of Publication | Type |
|---|
\((\overrightarrow{P_6}\), triangle)-free digraphs have bounded dichromatic number
The Electronic Journal of Combinatorics | 2025-01-27 | Paper |
Heroes in oriented complete multipartite graphs
Journal of Graph Theory | 2024-02-23 | Paper |
Improved pyrotechnics: closer to the burning number conjecture
The Electronic Journal of Combinatorics | 2024-02-16 | Paper |
A new graph parameter to measure linearity
Journal of Graph Theory | 2023-10-12 | Paper |
Edge clique covers in graphs with independence number two
Journal of Graph Theory | 2023-09-29 | Paper |
Digraph Colouring and Arc-Connectivity
| 2023-04-10 | Paper |
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
Journal of the ACM | 2022-12-08 | Paper |
(P6, triangle)-free digraphs have bounded dichromatic number
| 2022-12-05 | Paper |
Decomposing and colouring some locally semicomplete digraphs
European Journal of Combinatorics | 2022-09-14 | Paper |
Parameterized complexity of independent set in \(H\)-free graphs
| 2021-08-04 | Paper |
Extension of Gyárfás-Sumner conjecture to digraphs
The Electronic Journal of Combinatorics | 2021-06-07 | Paper |
Decomposing and colouring some locally semicomplete digraphs
| 2021-03-14 | Paper |
Parameterized complexity of independent set in H-free graphs
Algorithmica | 2020-08-12 | Paper |
Revisiting a theorem by Folkman on graph colouring
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations
Discrete Mathematics | 2019-08-20 | Paper |
χ‐bounded families of oriented graphs
Journal of Graph Theory | 2019-01-03 | Paper |
A new graph parameter to measure linearity
Lecture Notes in Computer Science | 2018-03-26 | Paper |
Limits of structures and the example of tree semi-lattices
Discrete Mathematics | 2017-08-01 | Paper |
Perfect graphs of arbitrarily large clique-chromatic number
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
Vertex elimination orderings for hereditary graph classes
Discrete Mathematics | 2015-01-30 | Paper |
On a generalization of the Ryser-Brualdi-Stein conjecture
Journal of Graph Theory | 2015-01-21 | Paper |
Influence of the tie-break rule on the end-vertex problem
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2014-11-10 | Paper |
The graph formulation of the union-closed sets conjecture
European Journal of Combinatorics | 2014-10-08 | Paper |
Graphs with large chromatic number induce $3k$-cycles
| 2014-08-09 | Paper |
The graph formulation of the union-closed sets conjecture
The Seventh European Conference on Combinatorics, Graph Theory and Applications | 2014-06-11 | Paper |
Detecting 2-joins faster
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Linear time split decomposition revisited
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
The fractional chromatic number of Zykov products of graphs
Applied Mathematics Letters | 2011-01-20 | Paper |
A note on computing set overlap classes
Information Processing Letters | 2010-06-09 | Paper |
Cyclic orders: equivalence and duality
Combinatorica | 2008-10-21 | Paper |
Infinite Locally Random Graphs
Internet Mathematics | 2008-04-29 | Paper |
Finding a vector orthogonal to roughly half a collection of vectors
Journal of Complexity | 2008-03-26 | Paper |
Graphs with Large Girth Not Embeddable in the Sphere
Combinatorics, Probability and Computing | 2007-11-22 | Paper |
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
Combinatorics, Probability and Computing | 2007-03-20 | Paper |
Dichromatic Number and Cycle Inversions
| N/A | Paper |
