Distinguishing graphs of maximum valence 3

Svenja Hüning, Wilfried Imrich, Judith Kloas +2

The distinguishing number $D(G)$ of a graph $G$ is the smallest number of colors that is needed to color $G$ such that the only color preserving automorphism is the identity. We gi…