1 paper · 2 filters
Michael D. Barrus, Jean Guillaume, Benjamin Lantz
The distinguishing chromatic number of a graph G is the smallest number of colors needed to properly color the vertices of G so that the trivial automorphism is the only symmet…