| Publication | Date of Publication | Type |
|---|
On generalised majority edge-colourings of graphs
The Electronic Journal of Combinatorics | 2025-01-27 | Paper |
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
European Journal of Combinatorics | 2024-07-08 | Paper |
Inclusion chromatic index of random graphs
Journal of Graph Theory | 2024-04-29 | Paper |
A note on decomposing graphs to locally almost irregular subgraphs
Applied Mathematics and Computation | 2024-04-18 | Paper |
A note on the conflict-free chromatic index
Discrete Mathematics | 2024-02-19 | Paper |
On triangle-free list assignments
Discrete Mathematics | 2024-01-25 | Paper |
On a problem of Steinhaus
Bulletin of the London Mathematical Society | 2023-12-18 | Paper |
On conflict-free proper colourings of graphs without small degree vertices
Discrete Mathematics | 2023-10-30 | Paper |
A generalization of Faudree–Lehel conjecture holds almost surely for random graphs
Random Structures & Algorithms | 2023-10-17 | Paper |
Conflict‐free chromatic number versus conflict‐free chromatic index
Journal of Graph Theory | 2023-10-05 | Paper |
Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
Journal of Graph Theory | 2023-10-05 | Paper |
On the inclusion chromatic index of a graph
Journal of Graph Theory | 2023-09-29 | Paper |
| On generalised majority edge-colourings of graphs | 2023-09-28 | Paper |
| Mrs. Correct and Majority Colorings | 2022-07-20 | Paper |
On the standard \((2,2)\)-conjecture
European Journal of Combinatorics | 2021-04-14 | Paper |
Largest component and node fault tolerance for grids
The Electronic Journal of Combinatorics | 2021-03-17 | Paper |
The 1-2-3 conjecture almost holds for regular graphs
Journal of Combinatorial Theory. Series B | 2021-02-03 | Paper |
On a total version of 1-2-3 conjecture
Discussiones Mathematicae Graph Theory | 2020-08-26 | Paper |
| The 1-2-3 Conjecture holds for graphs with large enough minimum degree | 2020-03-29 | Paper |
Distant sum distinguishing index of graphs with bounded minimum degree
Ars Mathematica Contemporanea | 2020-02-21 | Paper |
On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
Journal of Combinatorial Optimization | 2020-02-03 | Paper |
Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs
Applied Mathematics and Computation | 2019-11-22 | Paper |
Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture
Discrete Applied Mathematics | 2019-09-19 | Paper |
Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number
Random Structures & Algorithms | 2019-08-14 | Paper |
| A general decomposition theory for the 1-2-3 conjecture and locally irregular decompositions | 2019-05-23 | Paper |
A note on asymptotically optimal neighbour sum distinguishing colourings
European Journal of Combinatorics | 2019-01-29 | Paper |
Distant total sum distinguishing index of graphs
Discrete Mathematics | 2019-01-22 | Paper |
| On locally irregular decompositions and the 1-2 conjecture in digraphs | 2018-12-10 | Paper |
Group twin coloring of graphs
(available as arXiv preprint) | 2018-12-10 | Paper |
| Group twin coloring of graphs | 2018-12-10 | Paper |
New bounds for locally irregular chromatic index of bipartite and subcubic graphs
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
A note on the weak \((2,2)\)-conjecture
Discrete Mathematics | 2018-11-29 | Paper |
Equitable neighbour-sum-distinguishing edge and total colourings
Discrete Applied Mathematics | 2018-09-25 | Paper |
Distant total irregularity strength of graphs via random vertex ordering
Discrete Mathematics | 2018-02-23 | Paper |
On the neighbour sum distinguishing index of graphs with bounded maximum average degree
Graphs and Combinatorics | 2018-02-14 | Paper |
A note on a directed version of the 1-2-3 conjecture
Discrete Applied Mathematics | 2018-01-11 | Paper |
Distant set distinguishing edge colourings of graphs
European Journal of Combinatorics | 2017-12-21 | Paper |
Distant irregularity strength of graphs with bounded minimum degree
Discrete Applied Mathematics | 2017-10-17 | Paper |
On the neighbor sum distinguishing index of planar graphs
Journal of Graph Theory | 2017-08-08 | Paper |
Distant sum distinguishing index of graphs
Discrete Mathematics | 2017-08-01 | Paper |
The neighbour-sum-distinguishing edge-colouring game
Discrete Mathematics | 2017-05-10 | Paper |
On a directed variation of the 1-2-3 and 1-2 conjectures
Discrete Applied Mathematics | 2017-03-15 | Paper |
On weight choosabilities of graphs with bounded maximum average degree
Discrete Applied Mathematics | 2017-03-15 | Paper |
Asymptotically optimal neighbor sum distinguishing total colorings of graphs
Discrete Mathematics | 2016-12-14 | Paper |
Distant set distinguishing total colourings of graphs
The Electronic Journal of Combinatorics | 2016-07-06 | Paper |
Distant set distinguishing total colourings of graphs
The Electronic Journal of Combinatorics | 2016-07-06 | Paper |
On the facial Thue choice number of plane graphs via entropy compression method
Graphs and Combinatorics | 2016-06-09 | Paper |
On decomposing graphs of large minimum degree into locally irregular subgraphs
The Electronic Journal of Combinatorics | 2016-05-20 | Paper |
On decomposing graphs of large minimum degree into locally irregular subgraphs
The Electronic Journal of Combinatorics | 2016-05-20 | Paper |
A note on adjacent vertex distinguishing colorings of graphs
Discrete Applied Mathematics | 2016-04-07 | Paper |
Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
Discrete Applied Mathematics | 2016-02-12 | Paper |
Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
Journal of Graph Theory | 2016-02-01 | Paper |
On an extremal problem in the class of bipartite 1-planar graphs
Discussiones Mathematicae Graph Theory | 2016-01-26 | Paper |
Asymptotically optimal neighbour sum distinguishing colourings of graphs
Random Structures & Algorithms | 2016-01-07 | Paper |
On decomposing regular graphs into locally irregular subgraphs
European Journal of Combinatorics | 2015-06-18 | Paper |
On the facial Thue choice index via entropy compression
Journal of Graph Theory | 2014-11-17 | Paper |
On the facial Thue choice index via entropy compression
Journal of Graph Theory | 2014-11-17 | Paper |
On the structure of arbitrarily partitionable graphs with given connectivity
Discrete Applied Mathematics | 2014-09-12 | Paper |
Colour-blind can distinguish colour pallets
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
How to personalize the vertices of a graph?
European Journal of Combinatorics | 2014-08-28 | Paper |
Can colour-blind distinguish colour palettes?
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
On colour-blind distinguishing colour pallets in regular graphs
Journal of Combinatorial Optimization | 2014-07-11 | Paper |
On the irregularity strength of dense graphs
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
Total vertex irregularity strength of dense graphs
Journal of Graph Theory | 2014-05-28 | Paper |
| scientific article; zbMATH DE number 6291271 (Why is no real title available?) | 2014-05-02 | Paper |
On upper bounds for multiple domination numbers of graphs
Discrete Applied Mathematics | 2014-04-10 | Paper |
| scientific article; zbMATH DE number 6273774 (Why is no real title available?) | 2014-03-25 | Paper |
Distant irregularity strength of graphs
Discrete Mathematics | 2014-01-27 | Paper |
Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
Partitioning powers of traceable or Hamiltonian graphs
Theoretical Computer Science | 2014-01-13 | Paper |
Rainbow connection in sparse graphs
Discussiones Mathematicae. Graph Theory | 2013-12-13 | Paper |
Neighbor sum distinguishing index
Graphs and Combinatorics | 2013-09-26 | Paper |
On minimal arbitrarily partitionable graphs
Information Processing Letters | 2012-10-23 | Paper |
Seifert graphs and the braid index of classical and singular links
Discrete Mathematics | 2012-09-12 | Paper |
Total weight choosability of graphs
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Total weight choosability of graphs
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Nonrepetitive list colourings of paths
Random Structures & Algorithms | 2011-01-17 | Paper |
Vertex-distinguishing edge-colorings of linear forests
Discussiones Mathematicae Graph Theory | 2010-12-08 | Paper |
| On a \(1,2\) conjecture | 2010-07-27 | Paper |
A new upper bound for the total vertex irregularity strength of graphs
Discrete Mathematics | 2009-12-15 | Paper |
Decompositions of pseudographs into closed trails of even sizes
Discrete Mathematics | 2009-12-15 | Paper |
Irregularity strength of regular graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Irregularity strength of regular graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
A note on neighbour-distinguishing regular graphs total-weighting
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
A note on neighbour-distinguishing regular graphs total-weighting
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Arbitrarily vertex decomposable caterpillars with four or five leaves
Discussiones Mathematicae Graph Theory | 2008-07-01 | Paper |
| Irregular edge-colorings of sums of cycles of even lengths | 2008-03-11 | Paper |
Decomposability of regular graphs to $4$ locally irregular subgraphs
(available as arXiv preprint) | N/A | Paper |
