| 毛虫树可均匀k-着色的一个充要条件 |
| |
| 引用本文： | 王秀梅.毛虫树可均匀k-着色的一个充要条件[J].商丘师范学院学报,2004,20(5):58-59. |
| |
| 作者姓名： | 王秀梅 |
| |
| 作者单位： | 商丘师范学院,数学系,河南,商丘,476000 |
| |
| 摘 要： | 如果一个图的顶点集可以划分为基数尽可能相等的k个独立集。则称该图是可均匀k-着色的．本文得到了毛虫树可均匀k-着色的一个充要条件．
|
| 关 键 词： | 毛虫树 可均匀k-着色 均匀色数 |
| 文章编号： | 1672-3600(2004)05-0058-02 |
| 修稿时间： | 2003年8月2日 |
A sufficient and necessary condition for equitable k-coloring of caterpillars |
| |
| WANG Xiu-mei.A sufficient and necessary condition for equitable k-coloring of caterpillars[J].Journal of Shangqiu Teachers College,2004,20(5):58-59. |
| |
| Authors: | WANG Xiu-mei |
| |
| 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. |
| |
| Keywords: | caterpillar equitably k-colorable equitable chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
