A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most one. The celebrated Hajnal-Szemerédi Theorem states: For every positive integer r, every graph with maximum degree at most r has an equitable coloring with r+1 colors. We show that this coloring can be obtained in O(rn2) time, where n is the number of vertices.
|Original language||English (US)|
|Number of pages||8|
|State||Published - 2010|
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics