毛虫树可均匀k-着色的一个充要条件  

A sufficient and necessary condition for equitable k-coloring of caterpillars

作　　者：王秀梅[1] 

机构地区：[1]商丘师范学院数学系,河南商丘476000

出　　处：《商丘师范学院学报》2004年第5期58-59,共2页Journal of Shangqiu Normal University

摘　　要：如果一个图的顶点集可以划分为基数尽可能相等的k个独立集,则称该图是可均匀k 着色的.本文得到了毛虫树可均匀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 we determine a sufficient and necessary condition for which a caterpillar is equitably k-colorable.

关 键 词：毛虫树 可均匀k-着色 均匀色数 

分 类 号：O157.5[理学—数学]