1 paper
Bruno Aguilar, Daibik Barik, Jetharam Bhambhu +7
The asymmetric coloring number of a graph is the minimum number of colors needed to color its vertices, so that no non-trivial automorphism preserves the color classes. We investig…