The proper vertex colorings of a graph, called as equitable colorings were discussed. The minimum number l was found, such that every d-degenerate graph with maximum degree at most δ admits an equitable coloring for every t ≥ l when δ ≥ 27d. The upper bounds on eq(G) for d-degenerate graphs with the given maximum degree were also found.
ASJC Scopus subject areas
- Theoretical Computer Science
- Statistics and Probability
- Computational Theory and Mathematics
- Applied Mathematics