Equitable colorings with constant number of colors

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 458-459

  Pemmaraju, S V ^a   Nakprasit, K ^b   Kostochka, A V ^a,c  

^a University of Iowa   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COLOR; FUNCTIONS; POLYNOMIALS; THEOREM PROVING; TREES (MATHEMATICS);

CHERNOFF-HOEFDING BOUNDS; EQUITABLE CHROMATIC NUMBER; EQUITABLE COLORING;

ALGORITHMS;

EID: 0038754142     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. B. Bollob́as and R.K. Guy. Equitable and Proportional Coloring of Trees. Journal of Combinatorial Theory, Series B, 34:177-186, 1983.
2. A. Hajnal and E. Szemerédi. Proof of a conjecture of Erdös. In P. Erdös, A. Rényi, and V.T. Sós, editors. Combinatorial Theory and Its Applications, Vol II, Volume 4 of Colloquia Mathematica Societatis János Bolyai, 601-623. North-Holland 1970.
3. A.V. Kostochka and K. Nakprasit. Equitable Colorings of d-degenerate graphs. Submitted.
4. W. Meyer. Equitable Coloring. American Mathematical Monthly, 80:143-149, 1973.
5. S.V. Pemmeraju. Equitable Colorings Extend Chernoff-Hoeffding Bounds. In Proceedings of the Twelfth ACM-SIAM Symposium Discrete Algorithms, 2001.