A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
Let c:E(G)→ [k] be an edge-coloring of a graph G, not necessarily proper. For each vertex v, let c̅(v)=(a_1,...,a_k), where a_i is the number of edges incident to v with color i. Reorder c̅(v) for every v in G in nonincreasing order to obtain c^*(v), the color-blind partition of v. When c^* induces a proper vertex coloring, that is, c^*(u)≠ c^*(v) for every edge uv in G, we say that c is color-blind distinguishing. The minimum k for which there exists a color-blind distinguishing edge coloringdoi:10.1016/j.dam.2017.03.006 fatcat:wk6gbsunsnh5tfanmndagzmfqy