3 citations · 5 across the 7 of their papers we have counts for
1 paper · 1 filter
Florian Lehner
The distinguishing index D′(G) of a graph G is the least number of colours needed in an edge colouring which is not preserved by any non-trivial automorphism. Broere and Pilśni…