| Publication | Date of Publication | Type |
|---|
| On inducing degenerate sums through 2-labellings | 2024-02-15 | Paper |
| Between proper and strong edge‐colorings of subcubic graphs | 2023-10-05 | Paper |
| A proof of the multiplicative 1-2-3 conjecture | 2023-10-04 | Paper |
| The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures | 2023-08-17 | Paper |
| A proof of the multiplicative 1-2-3 conjecture | 2023-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875547 | 2023-02-03 | Paper |
| On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs | 2022-11-17 | Paper |
| Between Proper and Strong Edge-Colorings of Subcubic Graphs | 2022-10-13 | Paper |
| Going wide with the 1-2-3 conjecture | 2022-08-24 | Paper |
| On a list variant of the multiplicative 1-2-3 conjecture | 2022-05-09 | Paper |
| Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity | 2022-05-03 | Paper |
| Further evidence towards the multiplicative 1-2-3 conjecture | 2021-12-07 | Paper |
| Complexity and algorithms for injective edge-coloring in graphs | 2021-06-16 | Paper |
| Complexity and algorithms for injective edge-coloring in graphs | 2021-04-16 | Paper |
| Exact square coloring of subcubic planar graphs | 2021-03-25 | Paper |
| Between proper and strong edge-colorings of subcubic graphs | 2020-11-04 | Paper |
| From light edges to strong edge-colouring of 1-planar graphs | 2020-10-28 | Paper |
| On a total version of 1-2-3 conjecture | 2020-08-26 | Paper |
| A connected version of the graph coloring game | 2020-06-29 | Paper |
| On the total neighbour sum distinguishing index of graphs with bounded maximum average degree | 2020-02-03 | Paper |
| Coloring squares of graphs with mad constraints | 2019-11-27 | Paper |
| Edge weights and vertex colours: minimizing sum count | 2019-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5377221 | 2019-05-23 | Paper |
| On locally irregular decompositions of subcubic graphs | 2018-12-10 | Paper |
| On the neighbour sum distinguishing index of graphs with bounded maximum average degree | 2018-02-14 | Paper |
| Incidence coloring of graphs with high maximum average degree | 2017-06-19 | Paper |
| Incidence coloring of planar graphs without adjacent small cycles | 2017-01-10 | Paper |
| Strong edge coloring sparse graphs | 2016-10-14 | Paper |
| Strong edge-colouring of sparse planar graphs | 2014-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419983 | 2014-06-11 | Paper |
| Strong edge-colouring and induced matchings | 2014-04-14 | Paper |
| On strong edge-colouring of subcubic graphs | 2014-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857387 | 2013-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857388 | 2013-11-01 | Paper |
| Acyclic choosability of planar graphs: a Steinberg like approach | 2013-10-10 | Paper |
| Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) | 2013-08-09 | Paper |
| Graphs with maximum degree \(6\) are acyclically \(11\)-colorable | 2013-04-04 | Paper |
| Strong edge colouring of subcubic graphs | 2011-10-27 | Paper |
| A note on the acyclic 3-choosability of some planar graphs | 2010-10-11 | Paper |
| Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable | 2010-09-01 | Paper |
