10 citations · 27 across the 5 of their papers we have counts for
1 paper · 2 filters
M. Korivand, N. Soltankhah, K. Khashyarmanesh
A graph is called uniquely distinguishing colorable if there is only one partition of vertices of the graph that forms distinguishing coloring with the smallest possible colors. In…