12 citations · 12 across the 16 of their papers we have counts for
5 papers · 1 filter
List majority edge-colorings of graphs
Rafał Kalinowski, Monika Pilśniak, Marcin Stawiski
A majority edge-coloring of a graph without pendant edges is a coloring of its edges such that, for every vertex and every color , there are at most as many edges incident t…
Breaking small automorphisms by list colourings
Jakub Kwaśny, Marcin Stawiski
For a graph G, we define a small automorphism as one that maps some vertex into its neighbour. We investigate the edge colourings of G that break every small automorphism of G. We…
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…