On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two

Elaine M. Eschen, Chinh T. Hoang, R. Sritharan +1

In an article [3] published recently in this journal, it was shown that when k >= 3, the problem of deciding whether the distinguishing chromatic number of a graph is at most k is…