| Publication | Date of Publication | Type |
|---|
The Maker-Breaker Largest Connected Subgraph Game
(available as arXiv preprint) | N/A | Paper |
Proper labellings of graphs with unlabellable edges
Discrete Applied Mathematics | 2026-09-18 | Paper |
Pushing vertices to make graphs irregular
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-06-04 | Paper |
Some remarks and results on the standard (2,2)-conjecture
Opuscula Mathematica | 2026-04-20 | Paper |
Making graphs irregular through irregularising walks
Theoretical Computer Science | 2026-02-27 | Paper |
An improved bound for equitable proper labellings
Discrete Mathematics | 2026-02-16 | Paper |
The strong (2, 2)-conjecture for more classes of graphs
Discrete Applied Mathematics | 2026-02-11 | Paper |
Toughness properties of arbitrarily partitionable graphs
Discrete Applied Mathematics | 2025-11-04 | Paper |
Partitioning vertices and edges of graphs into connected subgraphs
Applied Mathematics and Computation | 2025-10-02 | Paper |
Maximising 1's through proper labellings
Discussiones Mathematicae. Graph Theory | 2025-05-15 | Paper |
On proper 2-labellings distinguishing by sums, multisets or products
Discussiones Mathematicae. Graph Theory | 2025-05-12 | Paper |
A _3 condition for arbitrarily partitionable graphs
Discussiones Mathematicae. Graph Theory | 2025-05-12 | Paper |
On a graph labelling conjecture involving coloured labels
Discussiones Mathematicae. Graph Theory | 2025-05-12 | Paper |
Irregularity notions for digraphs
Graphs and Combinatorics | 2025-04-25 | Paper |
| An improved bound for equitable proper labellings | 2025-02-28 | Paper |
On 1-2-3 conjecture-like problems in 2-edge-coloured graphs
Discrete Mathematics | 2025-02-11 | Paper |
Highly irregular graph decompositions
Theoretical Computer Science | 2025-02-03 | Paper |
Adding direction constraints to the 1-2-3 conjecture
Theoretical Computer Science | 2024-12-12 | Paper |
Arbitrarily edge-partitionable graphs
Discrete Applied Mathematics | 2024-12-04 | Paper |
Closure results for arbitrarily partitionable graphs
Opuscula Mathematica | 2024-11-25 | Paper |
Oriented total-coloring of oriented graphs
Discrete Mathematics | 2024-08-19 | Paper |
Interplays between variations of arbitrarily partitionable graphs under minimality constraints
Applied Mathematics and Computation | 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
Graphs and Combinatorics | 2024-02-15 | Paper |
A notion of vertex equitability for proper labellings
Discrete Applied Mathematics | 2024-02-14 | Paper |
| Extending drawings of graphs to arrangements of pseudolines | 2023-11-02 | Paper |
A proof of the multiplicative 1-2-3 conjecture
Combinatorica | 2023-10-04 | Paper |
| Some properties of minimal arbitrarily partitionable graphs | 2023-08-23 | Paper |
The weak (2, 2)-labelling problem for graphs with forbidden induced structures
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
A proof of the multiplicative 1-2-3 conjecture
Algorithms and Discrete Applied Mathematics | 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
Discrete Applied Mathematics | 2023-02-24 | Paper |
The maker-breaker largest connected subgraph game
Theoretical Computer Science | 2023-01-05 | Paper |
On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs
Theoretical Computer Science | 2022-11-17 | Paper |
Metric dimension: from graphs to oriented graphs
Discrete Applied Mathematics | 2022-11-02 | Paper |
On the hardness of determining the irregularity strength of graphs
Theoretical Computer Science | 2022-10-24 | Paper |
On Proper Labellings of Graphs with Minimum Label Sum
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Going wide with the 1-2-3 conjecture
Discrete Applied Mathematics | 2022-08-24 | Paper |
The largest connected subgraph game
Algorithmica | 2022-08-18 | Paper |
More aspects of arbitrarily partitionable graphs
Discussiones Mathematicae Graph Theory | 2022-07-26 | Paper |
On a vertex-capturing game
Theoretical Computer Science | 2022-06-13 | Paper |
Generalising the achromatic number to Zaslavsky's colourings of signed graphs
Theoretical Computer Science | 2022-06-13 | Paper |
The largest connected subgraph game
Graph-Theoretic Concepts in Computer Science | 2022-06-08 | Paper |
On a list variant of the multiplicative 1-2-3 conjecture
Graphs and Combinatorics | 2022-05-09 | Paper |
Metric dimension: from graphs to oriented graphs
Electronic Notes in Theoretical Computer Science | 2022-04-27 | Paper |
On proper labellings of graphs with minimum label sum
Algorithmica | 2022-03-22 | Paper |
On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)
Discussiones Mathematicae Graph Theory | 2022-01-03 | Paper |
Further evidence towards the multiplicative 1-2-3 conjecture
Discrete Applied Mathematics | 2021-12-07 | Paper |
On the signed chromatic number of some classes of graphs
Discrete Mathematics | 2021-11-23 | Paper |
On the role of 3s for the 1-2-3 conjecture
Theoretical Computer Science | 2021-10-21 | Paper |
Generalising the achromatic number to Zaslavsky's colourings of signed graphs
(available as arXiv preprint) | 2021-09-28 | Paper |
On \(\mathrm{BMRN}^\ast\)-colouring of planar digraphs
Discrete Mathematics & Theoretical Computer Science | 2021-05-03 | Paper |
Further results on an equitable 1-2-3 conjecture
Discrete Applied Mathematics | 2021-04-29 | Paper |
Decomposing degenerate graphs into locally irregular subgraphs
Graphs and Combinatorics | 2021-03-17 | Paper |
An injective version of the 1-2-3 conjecture
Graphs and Combinatorics | 2021-03-17 | Paper |
On generalisations of the AVD conjecture to digraphs
Graphs and Combinatorics | 2021-03-17 | Paper |
Extending drawings of graphs to arrangements of pseudolines
(available as arXiv preprint) | 2021-03-17 | Paper |
Pushable chromatic number of graphs with degree constraints
Discrete Mathematics | 2021-01-21 | Paper |
On minimizing the maximum color for the 1-2-3 conjecture
Discrete Applied Mathematics | 2020-12-29 | Paper |
| From light edges to strong edge-colouring of 1-planar graphs | 2020-10-28 | Paper |
Sequential metric dimension
Algorithmica | 2020-10-12 | Paper |
| Classification of edge-critical underlying absolute planar cliques for signed graphs | 2020-07-29 | Paper |
1-2-3 Conjecture in digraphs: more results and directions
Discrete Applied Mathematics | 2020-07-07 | Paper |
| On the 2-edge-coloured chromatic number of grids | 2019-12-19 | Paper |
Edge weights and vertex colours: minimizing sum count
Discrete Applied Mathematics | 2019-11-06 | Paper |
Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture
Discrete Applied Mathematics | 2019-09-19 | Paper |
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture
Combinatorica | 2019-09-04 | Paper |
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture
Combinatorica | 2019-09-04 | Paper |
| Backbone colouring and algorithms for TDMA scheduling | 2019-08-01 | Paper |
| A general decomposition theory for the 1-2-3 conjecture and locally irregular decompositions | 2019-05-23 | Paper |
Erratum to: ``On oriented cliques with respect to push operation''
Discrete Applied Mathematics | 2019-03-22 | Paper |
A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs
Discrete Applied Mathematics | 2019-03-11 | Paper |
Orienting edges to fight fire in graphs
(available as arXiv preprint) | 2019-01-30 | Paper |
| Orienting edges to fight fire in graphs | 2019-01-30 | Paper |
Sequential metric dimension
Approximation and Online Algorithms | 2019-01-15 | Paper |
| On locally irregular decompositions and the 1-2 conjecture in digraphs | 2018-12-10 | Paper |
On locally irregular decompositions of subcubic graphs
Opuscula Mathematica | 2018-12-10 | Paper |
Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture
Discrete Applied Mathematics | 2018-12-03 | Paper |
On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture
(available as arXiv preprint) | 2018-11-30 | 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
Journal of Combinatorial Theory. Series B | 2018-10-29 | Paper |
On improving matchings in trees, via bounded-length augmentations
Discrete Applied Mathematics | 2018-10-26 | Paper |
List coloring digraphs
Journal of Graph Theory | 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
The Electronic Journal of Combinatorics | 2017-12-12 | Paper |
Disjoint cycles of different lengths in graphs and digraphs
The Electronic Journal of Combinatorics | 2017-12-12 | Paper |
On oriented cliques with respect to push operation
Discrete Applied Mathematics | 2017-10-17 | Paper |
Analogues of cliques for \((m,n)\)-colored mixed graphs
Graphs and Combinatorics | 2017-10-11 | Paper |
On a directed variation of the 1-2-3 and 1-2 conjectures
Discrete Applied Mathematics | 2017-03-15 | Paper |
On \(q\)-power cycles in cubic graphs
Discussiones Mathematicae Graph Theory | 2017-01-23 | Paper |
Structural properties of recursively partitionable graphs with connectivity 2
Discussiones Mathematicae Graph Theory | 2017-01-23 | Paper |
Decomposing oriented graphs into six locally irregular oriented graphs
Graphs and Combinatorics | 2016-11-29 | Paper |
Decomposing graphs into a constant number of locally irregular subgraphs
European Journal of Combinatorics | 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
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2016-05-24 | Paper |
Edge-partitioning graphs into regular and locally irregular components
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2016-05-24 | Paper |
On three polynomial kernels of sequences for arbitrarily partitionable graphs
Discrete Applied Mathematics | 2016-02-12 | Paper |
Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
Discrete Mathematics | 2015-10-08 | Paper |
On the complexity of partitioning a graph into a few connected subgraphs
Journal of Combinatorial Optimization | 2015-07-01 | Paper |
On decomposing regular graphs into locally irregular subgraphs
European Journal of Combinatorics | 2015-06-18 | Paper |
An oriented version of the 1-2-3 conjecture
Discussiones Mathematicae Graph Theory | 2015-03-04 | Paper |
On the complexity of determining the irregular chromatic index of a graph
Journal of Discrete Algorithms | 2015-02-13 | Paper |
| Partitioning Harary graphs into connected subgraphs containing prescribed vertices | 2015-02-09 | Paper |
Strong edge-colouring of sparse planar graphs
Discrete Applied Mathematics | 2014-12-03 | Paper |
