1 paper
M. Korivand, D. A. Mojdeh, Edy Tri Baskoro +1
An edge-locating coloring of a simple connected graph G is a partition of its edge set into matchings such that the vertices of G are distinguished by the distance to the match…