On the distinguishing chromatic number in hereditary graph classes

Christoph Brause, Rafał Kalinowski, Monika Pilśniak +1

The distinguishing chromatic number of a graph $G$, denoted ${\chi }_D(G)$, is the minimum number of colours in a proper vertex colouring of $G$ that is preserved by the identity automor…