| Equitable Coloring of Complete r-partite Graphs |
| |
| 作者姓名： | WANG Xiu-mei |
| |
| 作者单位： | Department of Mathematics，Zhengzhou University，Zhengzhou 450052，China |
| |
| 摘 要： | 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 complete r-partite graph is equitably k-colorable. From this result, we can provide another way to prove some previous results.
|
Equitable Coloring of Complete r -partite Graphs |
| |
| WANG Xiu-mei.Equitable Coloring of Complete r-partite Graphs[J].Chinese Quarterly Journal of Mathematics,2004,19(4). |
| |
| 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 complete r-partite graph is equitably k-colorable. From this result, we can provide another way to prove some previous results. |
| |
| Keywords: | complete r-partite graph equitably k-colorable equitable chromatic number |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
