| Publication | Date of Publication | Type |
|---|
The Sierpiński domination number
Ars Mathematica Contemporanea | 2024-10-10 | Paper |
A note on uniquely embeddable 2-factors
Applied Mathematics and Computation | 2024-04-18 | Paper |
| List majority edge-colorings of graphs | 2023-12-01 | Paper |
Distinguishing infinite graphs with bounded degrees
Journal of Graph Theory | 2023-10-05 | Paper |
| The Sierpi\'{n}ski Domination Number | 2023-09-27 | Paper |
Majority edge-colorings of graphs
The Electronic Journal of Combinatorics | 2023-03-21 | Paper |
| Asymmetrizing infinite trees | 2023-01-24 | Paper |
Distinguishing arc-colourings of symmetric digraphs
The Art of Discrete and Applied Mathematics | 2022-12-19 | Paper |
Paired domination in trees
Graphs and Combinatorics | 2022-08-02 | Paper |
Paired domination stability in graphs
Ars Mathematica Contemporanea | 2022-07-18 | Paper |
Extremal graphs for the distinguishing index
Discrete Mathematics | 2022-05-27 | Paper |
Majority Edge-Colorings of Graphs
(available as arXiv preprint) | 2022-05-23 | Paper |
Nordhaus-Gaddum type inequalities for the distinguishing index
Ars Mathematica Contemporanea | 2022-03-24 | Paper |
Proper distinguishing arc-colourings of symmetric digraphs
Applied Mathematics and Computation | 2022-03-04 | Paper |
Corrigendum to: ``A bound for the distinguishing index of regular graphs
European Journal of Combinatorics | 2022-01-13 | Paper |
Bounds on the paired domination number of graphs with minimum degree at least three
Applied Mathematics and Computation | 2021-12-13 | Paper |
On asymmetric colourings of claw-free graphs
The Electronic Journal of Combinatorics | 2021-08-06 | Paper |
Asymmetric colorings of products of graphs and digraphs
Discrete Applied Mathematics | 2021-05-19 | Paper |
The distinguishing index of connected graphs without pendant edges
Ars Mathematica Contemporanea | 2021-05-19 | Paper |
A bound for the distinguishing index of regular graphs
European Journal of Combinatorics | 2020-09-15 | Paper |
On a total version of 1-2-3 conjecture
Discussiones Mathematicae Graph Theory | 2020-08-26 | Paper |
The optimal general upper bound for the distinguishing index of infinite graphs
Journal of Graph Theory | 2020-05-21 | Paper |
| On asymmetric colourings of graphs with bounded degrees and infinite motion | 2019-12-05 | Paper |
Distinguishing index of maps
European Journal of Combinatorics | 2019-11-28 | Paper |
Equitable neighbour-sum-distinguishing edge and total colourings
Discrete Applied Mathematics | 2018-09-25 | Paper |
Improving upper bounds for the distinguishing index
Ars Mathematica Contemporanea | 2018-02-26 | Paper |
The distinguishing index of the Cartesian product of countable graphs
Ars Mathematica Contemporanea | 2017-12-13 | Paper |
A note on breaking small automorphisms in graphs
Discrete Applied Mathematics | 2017-10-17 | Paper |
The distinguishing index of the Cartesian product of finite graphs
Ars Mathematica Contemporanea | 2017-09-14 | Paper |
Bounds for distinguishing invariants of infinite graphs
The Electronic Journal of Combinatorics | 2017-07-26 | Paper |
Bounds for distinguishing invariants of infinite graphs
The Electronic Journal of Combinatorics | 2017-07-26 | Paper |
Precise bounds for the distinguishing index of the Cartesian product
Theoretical Computer Science | 2017-06-13 | Paper |
Edge motion and the distinguishing index
Theoretical Computer Science | 2017-05-15 | Paper |
Distinguishing Cartesian products of countable 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 |
Distinguishing graphs by total colourings
Ars Mathematica Contemporanea | 2016-12-02 | Paper |
Dense arbitrarily partitionable graphs
Discussiones Mathematicae Graph Theory | 2016-01-26 | Paper |
On the total-neighbor-distinguishing index by sums
Graphs and Combinatorics | 2015-05-22 | Paper |
The distinguishing index of infinite graphs
The Electronic Journal of Combinatorics | 2015-04-22 | Paper |
Distinguishing graphs by edge-colourings
European Journal of Combinatorics | 2014-12-19 | Paper |
Endomorphism breaking in graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Endomorphism breaking in graphs
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 packing of two copies of a hypergraph | 2014-03-25 | Paper |
Coloring chip configurations on graphs and digraphs
Information Processing Letters | 2012-03-09 | Paper |
A note on an embedding problem in transitive tournaments
Discrete Mathematics | 2010-04-27 | Paper |
On-line arbitrarily vertex decomposable suns
Discrete Mathematics | 2009-12-15 | Paper |
Arbitrarily vertex decomposable suns with few rays
Discrete Mathematics | 2009-06-19 | Paper |
A note on packing of two copies of a hypergraph
Discussiones Mathematicae Graph Theory | 2008-02-22 | Paper |
| A note on decompositions of transitive tournaments. II | 2007-07-26 | Paper |
Some families of arbitrarily vertex decomposable graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Fixed-point-free embeddings of digraphs with small size
Discrete Mathematics | 2007-04-26 | Paper |
A note on decompositions of transitive tournaments
Discrete Mathematics | 2007-03-02 | Paper |
Packing of two digraphs into a transitive tournament
Discrete Mathematics | 2007-03-02 | Paper |
A note on a packing problem in transitive tournaments
Graphs and Combinatorics | 2006-09-12 | Paper |
Packing of three copies of a digraph into the transitive tournament
Discussiones Mathematicae Graph Theory | 2005-04-19 | Paper |
A note on embedding graphs without short cycles
Discrete Mathematics | 2004-10-01 | Paper |
On cyclically embeddable (n,n)-graphs
Discussiones Mathematicae Graph Theory | 2004-03-25 | Paper |
On 3-colourability of $(bull, H)$-free graphs
(available as arXiv preprint) | N/A | Paper |
