树均匀着色的一些结果

摘要

如果一个图的顶点集可以划分为基数尽可能相等的k个独立集,则称该图是可均匀k-着色的.本文得到树可均匀k-着色的一些条件;直径为4的树可均匀k-着色的一个充分必要条件和均匀色数表达式.%A graph is equitably k-colorable if its vertices can be partitioned into k independent sets of as near equal sizes as possible. In this paper, some conditions for which trees are equitably k-colorable are determined; a sufficient and necessary condition and an explicit formula for the equitable chromatic number of trees with diameter 4 are given.