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. © 2010 János Bolyai Mathematical Society and Springer Verlag.
CITATION STYLE
Kierstead, H. A., Kostochka, A. V., Mydlarz, M., & Szemerédi, E. (2010). A fast algorithm for equitable coloring. Combinatorica, 30(2), 217–224. https://doi.org/10.1007/s00493-010-2483-5
Mendeley helps you to discover research relevant for your work.