The concept of the locating-chromatic number for graphs was introduced by Chartrand et al. (2002). In this paper, we propose an algorithm to determine the upper bound of the locating-chromatic number of any tree. This algorithm works much better than the one given by Furuya and Matsumoto (2019).

中文翻译：

---

树色色数的改进算法

Chartrand等人介绍了图的定位色数的概念。（2002）。在本文中，我们提出了一种确定任何树的定位色数上限的算法。该算法比Furuya和Matsumoto（2019）给出的算法要好得多。