Distinguishing chromatic number of Hamiltonian circulant graphs
arXiv:2303.13759
Abstract
The distinguishing chromatic number of a graph is the smallest number of colors needed to properly color the vertices of so that the trivial automorphism is the only symmetry of that preserves the coloring. We investigate the distinguishing chromatic number for Hamiltonian circulant graphs with maximum degree at most 4.
4 figures