3 citations · 4 across the 11 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
Asymmetric edge-coloring of graphs with simple automorphism group
Mariusz Grech, Andrzej Kisielewicz
The distinguishing index of a graph is the least number such that has an edge-coloring with colors preserved only by the trivial automorphism. In this paper…
math.CO2021
A class of graphs with distinguishing index
Mariusz Grech, Andrzej Kisielewicz
An edge-coloring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Lehner, Pilśniak, and Stawiski proved that all connected regular graph…