6 citations · 6 across the 9 of their papers we have counts for
1 paper · 2 filters
Wilfried Imrich, Rafał Kalinowski, Monika Pilśniak +1
We consider infinite graphs. The distinguishing number D(G) of a graph G is the minimum number of colours in a vertex colouring of G that is preserved only by the trivial aut…