On the locating chromatic number of infinite trees
Combinatorics
2023-08-02 v3
Abstract
The locating chromatic number of a graph is the smallest integer such that there is a proper -coloring and every vertex has a unique vector of distances to colors in . We explore the necessary conditions and provide sufficient conditions for an infinite tree to have a finite locating chromatic number. We also give an algorithm for computing the locating coloring of trees that works for both finite and infinite trees.
Cite
@article{arxiv.2104.04914,
title = {On the locating chromatic number of infinite trees},
author = {Yusuf Hafidh and Devi Imulia Dian Primaskun and Edy Tri Baskoro},
journal= {arXiv preprint arXiv:2104.04914},
year = {2023}
}