A note on the vertex-distinguishing proper coloring of graphs with large minimum degree

Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Woźniak
2001 Discrete Mathematics  
We prove that the number of colors required to properly color the edges of a graph of order n and (G) ¿ n=3 in such a way that any two vertices are incident with di erent sets of colors is at most (G) + 5.
doi:10.1016/s0012-365x(00)00428-3 fatcat:qmqyjilj3rfmtbxl3v2b4uzzwy