A proper k-vertex-coloring of a graph G is a neighbor-locating k-coloring if for each pair of vertices in the same color class, the sets of colors found in their neighborhoods are different. The neighbor-locating chromatic number χNL(G) is the minimum k for which G admits a neighbor-locating k-coloring. A proper k-vertex-coloring of a graph G is a locating k-coloring if for each pair of vertices x and y in the same color-class, there exists a color class Si such that d(x, Si) ̸ = d(y, Si). The locating chromatic number χL(G) is the minimum k for which G admits a locating k-coloring. It follows that χ(G) ≤ χL(G) ≤ χNL(G) for any graph G, where χ(G) is the usual chromatic number of G.