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 com...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 results of equitable coloring of complete r-partite Graphs.
