A Bound for the Locating Chromatic Numbers of Trees

Ali Behtoei, Mahdi Anbarloei

Let $f$ be a proper $k$-coloring of a connected graph $G$ and $\Pi =(V_1,V_2,\dots ,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$,…