A Note on the m-Bounded Chromatic Number of a Tree

The m-bounded chromatic number of a graph G is the smallest number of colors required for a proper coloring of G in which each color is used at most m times. We will establish an exact formula for the m -bounded chromatic number of a tree.