毛虫树的性质与均匀着色数的计算

A Quality of Caterpillars and an Explicit Formula for the Equitable Chromatic Number of Caterpillars

称图G是可均匀k-着色的,如果可以用k种颜色给G的顶点着色,使得相邻的顶点不同色且各色类的基数至多差1.可得到毛虫树的一个性质和计算毛虫树的均匀色数的一个精确计算公式.

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 obtain a quality of caterpillars and an explicit formula for the equitable chromatic number of caterpillars.