4 papers
List distinguishing index of graphs
Jakub Kwaśny, Marcin Stawiski
We say that an edge colouring breaks an automorphism if some edge is mapped to an edge of a different colour. We say that the colouring is distinguishing if it breaks every non-ide…
A note on the 1-2-3 Theorem for infinite graphs
Marcin Stawiski
Karoński, Łuczak and Thomason conjectured in 2004 that for every finite graph without isolated edge, the edges can be assigned weights from in such a way that the endve…
Asymmetrizing infinite trees
Wilfried Imrich, Rafał Kalinowski, Florian Lehner +2
A graph is asymmetrizable if it has a set of vertices whose setwise stablizer only consists of the identity automorphism. The motion of a graph is the minimum number of ver…
The distinguishing index of graphs with infinite minimum degree
Marcin Stawiski, Trevor M. Wilson
The distinguishing index of a graph is the least number of colors necessary to obtain an edge coloring of that is preserved only by the trivial automorphism. We sho…