| Publication | Date of Publication | Type |
|---|
| Critical \((P_5,\mathit{dart})\)-free graphs | 2024-09-16 | Paper |
| Near optimal colourability on hereditary graph families | 2024-03-15 | Paper |
| The saturation number of \(K_{3,3}\) | 2024-01-17 | Paper |
| Coloring (\(P_5\), kite)-free graphs with small cliques | 2023-12-22 | Paper |
| Vertex-critical \((P_5, \mathrm{chair})\)-free graphs | 2023-11-13 | Paper |
| An optimal χ‐bound for (P6, diamond)‐free graphs | 2023-10-04 | Paper |
| On graphs with no induced five‐vertex path or paraglider | 2023-09-29 | Paper |
| Critical $(P_5,dart)$-Free Graphs | 2023-08-07 | Paper |
| Complexity of \(C_k\)-coloring in hereditary classes of graphs | 2023-05-19 | Paper |
| Some results on \(k\)-critical \(P_5\)-free graphs | 2023-05-11 | Paper |
| Critical (\(P_5\), bull)-free graphs | 2023-05-11 | Paper |
| A note on the rank of inclusion matrices | 2023-04-24 | Paper |
| Colouring graphs with no induced six-vertex path or diamond | 2023-03-30 | Paper |
| Colouring graphs with no induced six-vertex path or diamond | 2023-01-04 | Paper |
| The optimal $\chi$-bound for $(P_7,C_4,C_5)$-free graphs | 2022-12-10 | Paper |
| Some extremal results on the chromatic stability index | 2022-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075768 | 2022-05-11 | Paper |
| Short proofs on $k$-extendible graphs | 2021-10-07 | Paper |
| Square-free graphs with no induced fork | 2021-05-11 | Paper |
| \(k\)-critical graphs in \(P_5\)-free graphs | 2021-04-21 | Paper |
| \(k\)-critical graphs in \(P_5\)-free graphs | 2021-04-08 | Paper |
| List 3-coloring graphs with no induced \(P_6 + rP_3\) | 2021-02-01 | Paper |
| Colouring square-free graphs without long induced paths | 2020-08-05 | Paper |
| The class of \((P_7, C_4, C_5)\)-free graphs: decomposition, algorithms, and \(\chi \)-boundedness | 2020-05-21 | Paper |
| Complexity of $C_k$-coloring in hereditary classes of graphs | 2020-05-04 | Paper |
| Graphs without five-vertex path and four-vertex cycle | 2020-01-09 | Paper |
| Linearly \(\chi \)-bounding \((P_6, C_4)\)-free graphs | 2019-12-30 | Paper |
| Vertex-critical \((P_5\), banner)-free graphs | 2019-10-11 | Paper |
| A bound for the chromatic number of \((P_5, \text{gem})\)-free graphs | 2019-09-13 | Paper |
| Colouring square-free graphs without long induced paths | 2019-08-30 | Paper |
| \((2P_2,K_4)\)-free graphs are 4-colorable | 2019-08-29 | Paper |
| Bounding clique-width via perfect graphs | 2019-06-25 | Paper |
| On graphs with no induced five-vertex path or paraglider | 2019-03-27 | Paper |
| Critical \((P_6, \mathrm{banner})\)-free graphs | 2019-03-22 | Paper |
| List-three-coloring graphs with no induced $P_6+rP_3$ | 2018-06-28 | Paper |
| Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs | 2018-01-04 | Paper |
| Structure and algorithms for (cap, even hole)-free graphs | 2017-12-20 | Paper |
| Bounding the Clique‐Width of H‐Free Chordal Graphs | 2017-09-26 | Paper |
| Complexity of coloring graphs without paths and cycles | 2016-11-24 | Paper |
| Bounding the clique-width of \(H\)-free split graphs | 2016-11-02 | Paper |
| Bounding the clique-width of \(H\)-free split graphs | 2016-10-14 | Paper |
| Bounding clique-width via perfect graphs | 2016-04-08 | Paper |
| A note on coloring (even-hole,cap)-free graphs | 2015-10-30 | Paper |
| Improved complexity results on \(k\)-coloring \(P_t\)-free graphs | 2015-09-30 | Paper |
| Bounding the clique-width of \(H\)-free chordal graphs | 2015-09-16 | Paper |
| Narrowing the complexity gap for colouring \((C_{s},P_{t})\)-free graphs | 2015-05-20 | Paper |
| Complexity of coloring graphs without paths and cycles | 2014-03-31 | Paper |
| Paired-domination in claw-free graphs | 2014-02-14 | Paper |
| Improved complexity results on \(k\)-coloring \(P _{t }\)-free graphs | 2013-09-20 | Paper |
| Perfect matchings in paired domination vertex critical graphs | 2012-07-17 | Paper |
| A note on the upper bound for the paired-domination number of a graph with minimum degree at least two | 2011-03-16 | Paper |
| Some Results on Critical ($P_5,H$)-free Graphs | N/A | Paper |
