Neighbor-Locating Colorings in Graphs

Liliana Alcon, Marisa Gutierrez, Carmen Hernando +2

A $k$-coloring of a graph $G$ is a $k$-partition $\Pi =\{S_1,\dots ,S_k\}$ of $V(G)$ into independent sets, called \emph{colors}. A $k$-coloring is called \emph{neighbor-locating} if…