【摘要】 如果一个图的顶点集可以划分为基数尽可能相等的k个独立集,则称该图是可均匀k 着色的.本文得到了毛虫树可均匀k 着色的一个充要条件.更多还原

【Abstract】 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 we determine a sufficient and necessary condition for which a caterpillar is equitably k-colorable.更多还原