| Publication | Date of Publication | Type |
|---|
| Vertex-critical \((P_5,W_4)\)-free graphs | 2026-01-28 | Paper |
| Critical \((P_5,\mathit{dart})\)-free graphs | 2024-09-16 | Paper |
Near optimal colourability on hereditary graph families
Theoretical Computer Science | 2024-03-15 | Paper |
The saturation number of \(K_{3,3}\)
Discrete Mathematics | 2024-01-17 | Paper |
Coloring (\(P_5\), kite)-free graphs with small cliques
Discrete Applied Mathematics | 2023-12-22 | Paper |
Vertex-critical \((P_5, \mathrm{chair})\)-free graphs
Discrete Applied Mathematics | 2023-11-13 | Paper |
An optimal χ‐bound for (P6, diamond)‐free graphs
Journal of Graph Theory | 2023-10-04 | Paper |
On graphs with no induced five‐vertex path or paraglider
Journal of Graph Theory | 2023-09-29 | Paper |
| Critical $(P_5,dart)$-Free Graphs | 2023-08-07 | Paper |
Complexity of \(C_k\)-coloring in hereditary classes of graphs
Information and Computation | 2023-05-19 | Paper |
Some results on \(k\)-critical \(P_5\)-free graphs
Discrete Applied Mathematics | 2023-05-11 | Paper |
Critical (\(P_5\), bull)-free graphs
Discrete Applied Mathematics | 2023-05-11 | Paper |
A note on the rank of inclusion matrices
Graphs and Combinatorics | 2023-04-24 | Paper |
Colouring graphs with no induced six-vertex path or diamond
Lecture Notes in Computer Science | 2023-03-30 | Paper |
Colouring graphs with no induced six-vertex path or diamond
Theoretical Computer Science | 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
Bulletin of the Australian Mathematical Society | 2022-09-19 | Paper |
scientific article; zbMATH DE number 7525468 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-11 | Paper |
| Short proofs on $k$-extendible graphs | 2021-10-07 | Paper |
Square-free graphs with no induced fork
The Electronic Journal of Combinatorics | 2021-05-11 | Paper |
\(k\)-critical graphs in \(P_5\)-free graphs
Lecture Notes in Computer Science | 2021-04-21 | Paper |
\(k\)-critical graphs in \(P_5\)-free graphs
Theoretical Computer Science | 2021-04-08 | Paper |
List 3-coloring graphs with no induced \(P_6 + rP_3\)
Algorithmica | 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
Journal of Graph Theory | 2020-05-21 | Paper |
Complexity of $C_k$-coloring in hereditary classes of graphs
(available as arXiv preprint) | 2020-05-04 | Paper |
Graphs without five-vertex path and four-vertex cycle
Applied Mathematics and Computation | 2020-01-09 | Paper |
Linearly \(\chi \)-bounding \((P_6, C_4)\)-free graphs
Journal of Graph Theory | 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
Bulletin of the Australian Mathematical Society | 2019-09-13 | Paper |
Colouring square-free graphs without long induced paths
Journal of Computer and System Sciences | 2019-08-30 | Paper |
Colouring square-free graphs without long induced paths
Journal of Computer and System Sciences | 2019-08-30 | Paper |
\((2P_2,K_4)\)-free graphs are 4-colorable
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Bounding clique-width via perfect graphs
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Bounding clique-width via perfect graphs
Journal of Computer and System Sciences | 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
Discrete Applied Mathematics | 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
Discrete Mathematics | 2017-12-20 | Paper |
Structure and algorithms for (cap, even hole)-free graphs
Discrete Mathematics | 2017-12-20 | Paper |
Bounding the Clique‐Width of H‐Free Chordal Graphs
Journal of Graph Theory | 2017-09-26 | Paper |
Complexity of coloring graphs without paths and cycles
Discrete Applied Mathematics | 2016-11-24 | Paper |
Bounding the clique-width of \(H\)-free split graphs
Discrete Applied Mathematics | 2016-11-02 | Paper |
Bounding the clique-width of \(H\)-free split graphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Bounding clique-width via perfect graphs
Language and Automata Theory and Applications | 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
European Journal of Combinatorics | 2015-09-30 | Paper |
Bounding the clique-width of \(H\)-free chordal graphs
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Narrowing the complexity gap for colouring \((C_{s},P_{t})\)-free graphs
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Narrowing the complexity gap for colouring \((C_{s},P_{t})\)-free graphs
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Complexity of coloring graphs without paths and cycles
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Paired-domination in claw-free graphs
Graphs and Combinatorics | 2014-02-14 | Paper |
Improved complexity results on \(k\)-coloring \(P _{t }\)-free graphs
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Perfect matchings in paired domination vertex critical graphs
Journal of Combinatorial Optimization | 2012-07-17 | Paper |
A note on the upper bound for the paired-domination number of a graph with minimum degree at least two
Networks | 2011-03-16 | Paper |
Some Results on Critical ($P_5,H$)-free Graphs
(available as arXiv preprint) | N/A | Paper |
