1. Bollobás and R. K. Guy, Equitable and proportional coloring of trees, J. Combin. Theory Ser. B, 34 (1983) 177–186.
2. R. L. Brooks, On colouring the nodes of a network, Proc. Cambridge Philos. Soc., 37 (1941) 194–197.
3. B.-L. Chen, M.-T. Ko, and K.-W. Lih, Equitable and m-bounded coloring of split graphs, in M. Deza, R. Euler, and I. Manoussakis, eds., Combinatorics and Computer Science, Lecture Notes in Computer Science 1120, (Springer, Berlin, 1996 ) 1–5.
4. B.-L. Chen and K.-W. Lih, A note on the m-bounded chromatic number of a tree, Europ. J. Combinatorics, 14 (1993) 311–312.
5. B.-L. Chen and K.-W. Lih, Equitable coloring of trees, J. Combin. Theory Ser B, 61 (1994) 83–87.