On the locating chromatic number of infinite trees

Authors Yusuf Hafidh, Devi Imulia Dian Primaskun, E. T. Baskoro

Publication date 11 April 2021

Abstract: The locating chromatic number of a graph is the smallest integer

n

such that there is a proper

n

-coloring

c

and every vertices has unique vector of distance to colors in

c

. We explore necessary condition and give sufficient conditions for an infinite tree to have finite locating chromatic number. We also give an algorithm for computing the locating coloring of trees that works for both finite and infinite trees.

This page was built for publication: On the locating chromatic number of infinite trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6364989)