论文部分内容阅读
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.