2024
On Inducing Degenerate Sums Through 2-Labellings.
Graphs Comb., April, 2024
On proper <i>2</i>-labellings distinguishing by sums, multisets or products.
Discuss. Math. Graph Theory, 2024
A <i>\sigma<sub>3</sub></i> condition for arbitrarily partitionable graphs.
Discuss. Math. Graph Theory, 2024
On a graph labelling conjecture involving coloured labels.
Discuss. Math. Graph Theory, 2024
Oriented total-coloring of oriented graphs.
Discret. Math., 2024
A notion of vertex equitability for proper labellings.
Discret. Appl. Math., 2024
Interplays between variations of arbitrarily partitionable graphs under minimality constraints.
Appl. Math. Comput., 2024
An Improved Bound for Equitable Proper Labellings.
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024
2023
On Finding the Best and Worst Orientations for the Metric Dimension.
Algorithmica, October, 2023
Some properties of minimal arbitrarily partitionable graphs.
Australas. J Comb., June, 2023
On the pushable chromatic number of various types of grids.
Discret. Appl. Math., April, 2023
A Proof of the Multiplicative 1-2-3 Conjecture.
Comb., February, 2023
On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs.
Theor. Comput. Sci., 2023
The Maker-Breaker Largest Connected Subgraph game.
Theor. Comput. Sci., 2023
Deciding the Erdős-Pósa Property in 3-Connected Digraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023
The Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023
2022
On a vertex-capturing game.
Theor. Comput. Sci., 2022
Generalising the achromatic number to Zaslavsky's colourings of signed graphs.
Theor. Comput. Sci., 2022
On the hardness of determining the irregularity strength of graphs.
Theor. Comput. Sci., 2022
On a List Variant of the Multiplicative 1-2-3 Conjecture.
Graphs Comb., 2022
More aspects of arbitrarily partitionable graphs.
Discuss. Math. Graph Theory, 2022
On {a, b}-edge-weightings of bipartite graphs with odd a, b.
Discuss. Math. Graph Theory, 2022
On the signed chromatic number of some classes of graphs.
Discret. Math., 2022
Metric dimension: From graphs to oriented graphs.
Discret. Appl. Math., 2022
Going Wide with the 1-2-3 Conjecture.
Discret. Appl. Math., 2022
Further evidence towards the multiplicative 1-2-3 Conjecture.
Discret. Appl. Math., 2022
On Proper Labellings of Graphs with Minimum Label Sum.
Algorithmica, 2022
The Largest Connected Subgraph Game.
Algorithmica, 2022
2021
On the role of 3s for the 1-2-3 Conjecture.
Theor. Comput. Sci., 2021
Extending Drawings of Graphs to Arrangements of Pseudolines.
J. Comput. Geom., 2021
An Injective Version of the 1-2-3 Conjecture.
Graphs Comb., 2021
On Generalisations of the AVD Conjecture to Digraphs.
Graphs Comb., 2021
On BMRN*-colouring of planar digraphs.
Discret. Math. Theor. Comput. Sci., 2021
Pushable chromatic number of graphs with degree constraints.
Discret. Math., 2021
On minimizing the maximum color for the 1-2-3 Conjecture.
Discret. Appl. Math., 2021
Further results on an equitable 1-2-3 Conjecture.
Discret. Appl. Math., 2021
On the Role of 3's for the 1-2-3 Conjecture.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021
2020
Decomposing Degenerate Graphs into Locally Irregular Subgraphs.
Graphs Comb., 2020
From light edges to strong edge-colouring of 1-planar graphs.
Discret. Math. Theor. Comput. Sci., 2020
1-2-3 Conjecture in digraphs: More results and directions.
Discret. Appl. Math., 2020
Sequential Metric Dimension.
Algorithmica, 2020
Enumeration of edge-critical underlying absolute planar cliques for signed graphs.
Australas. J Comb., 2020
A contribution to distinguishing labellings of graphs.
, 2020
2019
Backbone colouring and algorithms for TDMA scheduling.
Discret. Math. Theor. Comput. Sci., 2019
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions.
Discret. Math. Theor. Comput. Sci., 2019
Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture.
Discret. Appl. Math., 2019
Erratum to "On oriented cliques with respect to push operation" [Discrete Appl. Math. 232 (2017) 50-63].
Discret. Appl. Math., 2019
A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs.
Discret. Appl. Math., 2019
Edge weights and vertex colours: Minimizing sum count.
Discret. Appl. Math., 2019
Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture.
Comb., 2019
On the 2-edge-coloured chromatic number of grids.
Australas. J Comb., 2019
2018
On locally irregular decompositions and the 1-2 Conjecture in digraphs.
Discret. Math. Theor. Comput. Sci., 2018
On improving matchings in trees, via bounded-length augmentations.
Discret. Appl. Math., 2018
Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture.
Discret. Appl. Math., 2018
Erratum for "On oriented cliques with respect to push operation".
CoRR, 2018
Orienting edges to fight fire in graphs.
Australas. J Comb., 2018
2017
A proof of the Barát-Thomassen conjecture.
J. Comb. Theory B, 2017
Analogues of Cliques for (m, n)-Colored Mixed Graphs.
Graphs Comb., 2017
Recovery of disrupted airline operations using k-Maximum Matching in graphs.
Electron. Notes Discret. Math., 2017
Decomposing graphs into a constant number of locally irregular subgraphs.
Eur. J. Comb., 2017
On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture.
Discret. Math. Theor. Comput. Sci., 2017
On <i>q</i>-power cycles in cubic graphs.
Discuss. Math. Graph Theory, 2017
Structural properties of recursively partitionable graphs with connectivity 2.
Discuss. Math. Graph Theory, 2017
On oriented cliques with respect to push operation.
Discret. Appl. Math., 2017
On a directed variation of the 1-2-3 and 1-2 Conjectures.
Discret. Appl. Math., 2017
Disjoint Cycles of Different Lengths in Graphs and Digraphs.
Electron. J. Comb., 2017
2016
Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs.
Graphs Comb., 2016
Edge-partitioning graphs into regular and locally irregular components.
Discret. Math. Theor. Comput. Sci., 2016
The complexity of deciding whether a graph admits an orientation with fixed weak diameter.
Discret. Math. Theor. Comput. Sci., 2016
Strong edge-coloring of (3, Δ)-bipartite graphs.
Discret. Math., 2016
On three polynomial kernels of sequences for arbitrarily partitionable graphs.
Discret. Appl. Math., 2016
2015
On the complexity of determining the irregular chromatic index of a graph.
J. Discrete Algorithms, 2015
On the complexity of partitioning a graph into a few connected subgraphs.
J. Comb. Optim., 2015
Strong edge coloring sparse graphs.
Electron. Notes Discret. Math., 2015
On decomposing regular graphs into locally irregular subgraphs.
Eur. J. Comb., 2015
An oriented version of the 1-2-3 Conjecture.
Discuss. Math. Graph Theory, 2015
2014
Partitioning powers of traceable or hamiltonian graphs.
Theor. Comput. Sci., 2014
Partitioning Harary graphs into connected subgraphs containing prescribed vertices.
Discret. Math. Theor. Comput. Sci., 2014
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph.
Discret. Math. Theor. Comput. Sci., 2014
Strong edge-colouring of sparse planar graphs.
Discret. Appl. Math., 2014
On cliques of signed and switchable signed graphs.
CoRR, 2014
