| Publication | Date of Publication | Type |
|---|
| Adding direction constraints to the 1-2-3 conjecture | 2024-12-12 | Paper |
| Arbitrarily edge-partitionable graphs | 2024-12-04 | Paper |
| Closure results for arbitrarily partitionable graphs | 2024-11-25 | Paper |
| Oriented total-coloring of oriented graphs | 2024-08-19 | Paper |
| Interplays between variations of arbitrarily partitionable graphs under minimality constraints | 2024-07-11 | Paper |
| Deciding the Erdős-Pósa Property in 3-Connected Digraphs | 2024-05-03 | Paper |
| On inducing degenerate sums through 2-labellings | 2024-02-15 | Paper |
| A notion of vertex equitability for proper labellings | 2024-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059956 | 2023-11-02 | Paper |
| A proof of the multiplicative 1-2-3 conjecture | 2023-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6134940 | 2023-08-23 | 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 |
| On the role of 3's for the 1-2-3 conjecture | 2023-03-22 | Paper |
| On the pushable chromatic number of various types of grids | 2023-02-24 | Paper |
| The maker-breaker largest connected subgraph game | 2023-01-05 | Paper |
| On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs | 2022-11-17 | Paper |
| Metric dimension: from graphs to oriented graphs | 2022-11-02 | Paper |
| On the hardness of determining the irregularity strength of graphs | 2022-10-24 | Paper |
| On Proper Labellings of Graphs with Minimum Label Sum | 2022-10-13 | Paper |
| Going wide with the 1-2-3 conjecture | 2022-08-24 | Paper |
| The largest connected subgraph game | 2022-08-18 | Paper |
| More aspects of arbitrarily partitionable graphs | 2022-07-26 | Paper |
| On a vertex-capturing game | 2022-06-13 | Paper |
| Generalising the achromatic number to Zaslavsky's colourings of signed graphs | 2022-06-13 | Paper |
| The largest connected subgraph game | 2022-06-08 | Paper |
| On a list variant of the multiplicative 1-2-3 conjecture | 2022-05-09 | Paper |
| Metric dimension: from graphs to oriented graphs | 2022-04-27 | Paper |
| On proper labellings of graphs with minimum label sum | 2022-03-22 | Paper |
| On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\) | 2022-01-03 | Paper |
| Further evidence towards the multiplicative 1-2-3 conjecture | 2021-12-07 | Paper |
| On the signed chromatic number of some classes of graphs | 2021-11-23 | Paper |
| On the role of 3s for the 1--2--3 conjecture | 2021-10-21 | Paper |
| Generalising the achromatic number to Zaslavsky's colourings of signed graphs | 2021-09-28 | Paper |
| On BMRN*-colouring of planar digraphs | 2021-05-03 | Paper |
| Further results on an equitable 1-2-3 conjecture | 2021-04-29 | Paper |
| Decomposing degenerate graphs into locally irregular subgraphs | 2021-03-17 | Paper |
| On generalisations of the AVD conjecture to digraphs | 2021-03-17 | Paper |
| An injective version of the 1-2-3 conjecture | 2021-03-17 | Paper |
| Extending Drawings of Graphs to Arrangements of Pseudolines | 2021-03-17 | Paper |
| Pushable chromatic number of graphs with degree constraints | 2021-01-21 | Paper |
| On minimizing the maximum color for the 1-2-3 conjecture | 2020-12-29 | Paper |
| From light edges to strong edge-colouring of 1-planar graphs | 2020-10-28 | Paper |
| Sequential metric dimension | 2020-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3300693 | 2020-07-29 | Paper |
| 1-2-3 Conjecture in digraphs: more results and directions | 2020-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5206936 | 2019-12-19 | Paper |
| Edge weights and vertex colours: minimizing sum count | 2019-11-06 | Paper |
| Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture | 2019-09-19 | Paper |
| Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture | 2019-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5226846 | 2019-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5377221 | 2019-05-23 | Paper |
| Erratum to: ``On oriented cliques with respect to push operation | 2019-03-22 | Paper |
| A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs | 2019-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4616090 | 2019-01-30 | Paper |
| Sequential metric dimension | 2019-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560260 | 2018-12-10 | Paper |
| On locally irregular decompositions of subcubic graphs | 2018-12-10 | Paper |
| Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture | 2018-12-03 | Paper |
| On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture | 2018-11-30 | Paper |
| A proof of the Barát-Thomassen conjecture | 2018-10-29 | Paper |
| On improving matchings in trees, via bounded-length augmentations | 2018-10-26 | Paper |
| List coloring digraphs | 2018-04-27 | Paper |
| Recovery of disrupted airline operations using \(k\)-maximum matching in graphs | 2018-04-09 | Paper |
| Disjoint cycles of different lengths in graphs and digraphs | 2017-12-12 | Paper |
| On oriented cliques with respect to push operation | 2017-10-17 | Paper |
| Analogues of cliques for \((m,n)\)-colored mixed graphs | 2017-10-11 | Paper |
| On a directed variation of the 1-2-3 and 1-2 conjectures | 2017-03-15 | Paper |
| On \(q\)-power cycles in cubic graphs | 2017-01-23 | Paper |
| Structural properties of recursively partitionable graphs with connectivity 2 | 2017-01-23 | Paper |
| Decomposing oriented graphs into six locally irregular oriented graphs | 2016-11-29 | Paper |
| Decomposing graphs into a constant number of locally irregular subgraphs | 2016-11-07 | Paper |
| Strong edge coloring sparse graphs | 2016-10-14 | Paper |
| The complexity of deciding whether a graph admits an orientation with fixed weak diameter | 2016-05-24 | Paper |
| Edge-partitioning graphs into regular and locally irregular components | 2016-05-24 | Paper |
| On three polynomial kernels of sequences for arbitrarily partitionable graphs | 2016-02-12 | Paper |
| Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs | 2015-10-08 | Paper |
| On the complexity of partitioning a graph into a few connected subgraphs | 2015-07-01 | Paper |
| On decomposing regular graphs into locally irregular subgraphs | 2015-06-18 | Paper |
| An oriented version of the 1-2-3 conjecture | 2015-03-04 | Paper |
| On the complexity of determining the irregular chromatic index of a graph | 2015-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5173159 | 2015-02-09 | Paper |
| Strong edge-colouring of sparse planar graphs | 2014-12-03 | Paper |
| Analogous to cliques for (m,n)-colored mixed graphs | 2014-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5420036 | 2014-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5413912 | 2014-05-02 | Paper |
| Partitioning powers of traceable or Hamiltonian graphs | 2014-01-13 | Paper |
| On the longest path in a recursively partitionable graph | 2013-11-26 | Paper |
| The Maker-Breaker Largest Connected Subgraph Game | N/A | Paper |
