Bounded vertex coloring of trees (Q5937457): Difference between revisions

The \(k\)-bounded chromatic number, \(\chi _{k}(G),\) of a graph \(G\) is the minimum number of colors required to color the vertices of \(G\) such that no two vertices receive the same color and each color is assigned to at most \(k\) vertices. It is shown that \(\chi _{k}(T)\leq \left\lceil n/k\right\rceil +1\) for every tree \(T\). The authors state that they characterize the trees that cannot be colored with the smallest possible number of colors. What they actually do is to characterize the trees with \(k\)-bounded chromatic number \(\left\lceil n/k\right\rceil +1.\)