Abstract Let G=(V, E) be a simple graph. Any partition of V (G) to k independent subsets is
called a k-coloring of G. If Π={S 1, S 2,⋯, S k} is a minimum such partition, then k is a …

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 …

A k-coloring of a graph is neighbor-locating if any two vertices with the same color can be
distinguished by the colors of their respective neighbors, that is, the sets of colors of their …

A $ k $-coloring of a graph $ G $ is a partition of the set of vertices of $ G $ into $ k $
independent sets, which are called colors. A $ k $-coloring is neighbor-locating if any two …

Abstract Let c: V (G)→{1,..., ℓ}=[ℓ] be a proper vertex coloring of G and C (i)={u∈ V (G): c (u)=
i} for i∈[ℓ]. The k-color code rk (v| c) of vertex v is the ordered ℓ-tuple (aG (v, C (1)),..., aG (v …

A proper k-coloring of a graph G is a neighbor-locating k-coloring if for each pair of vertices
in the same color class, the two sets of colors found in their respective neighborhoods are …

Let G be a simple finite graph. A k-coloring of G is a partition π={S1,···, Sk} of V (G) so that
each Si is an independent set and any vertex in Si takes color i. A k-coloring π={S1,···, Sk} of …

A k–coloring of a graph G=(V, E) is a k-partition Π={S 1,…, S k} of V into independent sets,
called colors. A k-coloring is called neighbor-locating if for every pair of vertices u, v …

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 …

Let G be a graph. A k-coloring of G is a partition π={S1,···, Sk} of V (G) so that each Si are
independent set and take same color. A k-coloring π={S1,···, Sk} of V (G) is a neighbor …