2 papers
math.CO2023
Edge-Locating Coloring of Graphs
M. Korivand, D. A. Mojdeh, Edy Tri Baskoro +1
An edge-locating coloring of a simple connected graph is a partition of its edge set into matchings such that the vertices of are distinguished by the distance to the match…
math.CO2021
On the comparison of the distinguishing coloring and the locating coloring of graphs
M. Korivand, A. Erfanian, Edy T. Baskoro
Let G be a simple connected graph. Then chi L(G) and chi D(G) will denote the locating chromatic number and the distinguishing chromatic number of G, respectively. In this paper, w…