摘要
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 give new methods to prove some known results of equitable coloring of complete r-partite Graphs.
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 give new methods to prove some known resuhs of equitable coloring of complete r-partite Graphs.
出处
《商丘师范学院学报》
CAS
2008年第9期42-44,共3页
Journal of Shangqiu Normal University
关键词
均匀染色
数学理论
计算方法
图论
complete r-partite graphs
equitably k-colorable
equitable chromatic number
