【摘要】 用k种颜色给一个图的顶点正常着色,即使相邻的顶点不同色,若各色类的基数至多差一,则称该图是可均匀k 着色的。基于均匀着色的理论本文得到了毛虫树可均匀k 着色的一个充分条件。更多还原

【Abstract】 A graph is equitably k-colorable if its vertices can be colored with kinds of colors even no adjacent vertices have common color and all color sets are of as near equal sizes as possible. Based on the theory of equitable coloring, a sufficient condition for a caterpillar is equitably k-colorable is obtained.更多还原