A fast algorithm for equitable coloring

Henry Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi

Research output: Contribution to journalArticle

37 Citations (Scopus)

Abstract

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 languageEnglish (US)
Pages (from-to)217-224
Number of pages8
JournalCombinatorica
Volume30
Issue number2
DOIs
StatePublished - 2010

Fingerprint

Equitable Coloring
Coloring
Fast Algorithm
Vertex Coloring
Graph in graph theory
Maximum Degree
Color
Colouring
Integer
Theorem

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Cite this

Kierstead, H., 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

A fast algorithm for equitable coloring. / Kierstead, Henry; Kostochka, Alexandr V.; Mydlarz, Marcelo; Szemerédi, Endre.

In: Combinatorica, Vol. 30, No. 2, 2010, p. 217-224.

Research output: Contribution to journalArticle

Kierstead, H, Kostochka, AV, Mydlarz, M & Szemerédi, E 2010, 'A fast algorithm for equitable coloring', Combinatorica, vol. 30, no. 2, pp. 217-224. https://doi.org/10.1007/s00493-010-2483-5
Kierstead, Henry ; Kostochka, Alexandr V. ; Mydlarz, Marcelo ; Szemerédi, Endre. / A fast algorithm for equitable coloring. In: Combinatorica. 2010 ; Vol. 30, No. 2. pp. 217-224.
@article{ea263a24cb524b56806df3933a382f82,
title = "A fast algorithm for equitable coloring",
abstract = "A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most one. The celebrated Hajnal-Szemer{\'e}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.",
author = "Henry Kierstead and Kostochka, {Alexandr V.} and Marcelo Mydlarz and Endre Szemer{\'e}di",
year = "2010",
doi = "10.1007/s00493-010-2483-5",
language = "English (US)",
volume = "30",
pages = "217--224",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "2",

}

TY - JOUR

T1 - A fast algorithm for equitable coloring

AU - Kierstead, Henry

AU - Kostochka, Alexandr V.

AU - Mydlarz, Marcelo

AU - Szemerédi, Endre

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77956970690&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956970690&partnerID=8YFLogxK

U2 - 10.1007/s00493-010-2483-5

DO - 10.1007/s00493-010-2483-5

M3 - Article

AN - SCOPUS:77956970690

VL - 30

SP - 217

EP - 224

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 2

ER -