Some Results of Equitable Coloring of Trees
Sujing Zhou · College Mathematics · 2008
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,some conditions for which trees are equitably k-colorable are determined;a sufficient and necessary condition and an explicit formula for the equitable chromatic number of trees with diameter 4 are given.