| Publication | Date of Publication | Type |
|---|
| List majority edge-colorings of graphs | 2023-12-01 | 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 |
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 |
Proper distinguishing arc-colourings of symmetric digraphs
Applied Mathematics and Computation | 2022-03-04 | 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 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 |
Dense on-line arbitrarily partitionable graphs
Discrete Applied Mathematics | 2017-06-14 | Paper |
Distinguishing Cartesian products of countable graphs
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 |
Edge-distinguishing index of a graph
Graphs and Combinatorics | 2015-01-20 | 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 |
Minimum number of palettes in edge colorings
Graphs and Combinatorics | 2014-06-16 | Paper |
| scientific article; zbMATH DE number 6291271 (Why is no real title available?) | 2014-05-02 | 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 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 |
Research problems from the Fourth Cracow Conference (Czorsztyn, 2002)
Discrete Mathematics | 2007-04-26 | Paper |
A note on decompositions of transitive tournaments
Discrete Mathematics | 2007-03-02 | Paper |
| scientific article; zbMATH DE number 915266 (Why is no real title available?) | 1996-10-17 | Paper |
Small periods of endomorphisms of trees
Discrete Mathematics | 1993-12-20 | Paper |
Large Isaacs' graphs are maximally non-Hamilton-connected
Discrete Mathematics | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4174965 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3922676 (Why is no real title available?) | 1985-01-01 | Paper |
A catalogue of small maximal nonhamiltonian graphs
Discrete Mathematics | 1982-01-01 | Paper |
