6 citations · 6 across the 9 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023
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…
math.CO2023
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…