On equitable coloring of d-degenerate graphs

SIAM Journal on Discrete Mathematics

Volumn 19, Issue 1, 2005, Pages 83-95

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

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

^b SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^c University of Iowa   (United States)

Author keywords

d degenerate graphs; Equitable coloring; Graph coloring

Indexed keywords

D-DEGENERATE GRAPHS; EQUITABLE COLORING; GRAPH COLORING;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY;

GRAPH THEORY;

EID: 27844569921     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103436505     Document Type: Article

References (26)

1. B. BAKER AND E. COFFMAN, Mutual exclusion scheduling, Theoret. Comput. Sci., 162 (1996), pp. 225-243.
2. J. BLAZEWICZ, K. ECKER, E. PESCH, G. SCHMIDT, AND J. WEGLARZ, Scheduling Computer and Manufacturing Processes, 2nd ed., Springer, Berlin, 2001.
3. H. L. BODLAENDER AND F. V. FOMIN, Equitable Colorings on Graphs with Bounded Treewidth, Tech. report UU-CS-2004-010, Universiteit Utrecht, Utrecht, The Netherlands.
4. B. BOLLOBÁS AND R. K. GUY, Equitable and proportional colorings of trees, J. Combin. Theory, Ser. B, 34 (1983), pp. 177-186.
5. B.-L. CHEN, K.-W. LIH, AND P.-L. WU, Equitable coloring and the maximum degree, European J. Combin., 15 (1994), pp. 443-447.
6. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York, 1979.
7. A. HAJNAL AND E. SZEMERÉDI, Proof of conjecture of Erdos, in Combinatorial Theory and its Applications, Vol. II, P. Erdos, A. Rényi, and V. T. Sós, eds., North-Holland, Amsterdam, 1970, pp. 601-603.
8. S. IRANI AND V. LEUNG, Scheduling with conflicts, and applications to traffic signal control, in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, ACM, New York, 1996, pp. 85-94.
9. S. JANSON, Large Deviations for Sums of Partly Dependent Random Variables, preprint NI02024-CMP, Isaac Newton Institute, Cambridge, UK, 2002; Available online at http://www.newton.cam.ac.uk/preprints/NI02024.pdf.
10. S. JANSON, T. LUCZAK, AND A. RUCIŃSKI, Random Graphs, Wiley-Interscience, New York, 2000.
11. S. JANSON AND A. RUCIŃSKI, The infamous upper tail, Random Structures Algorithms, 20 (2002), pp. 317-342.
12. F. KITAGAWA AND H. IKEDA, An existential problem of a weight-controlled subset and its application to school timetable construction, Discrete Math., 72 (1988), pp. 195-211.
13. J. KOMLÓS AND M. SIMONOVITS, Szemerédi's regularity lemma and its applications in graph theory, in Combinatorics: Paul Erdös Is Eighty, Vol. 2 (Keszthely, 1993), János Bolyai Math. Soc., Budapest, 1996, pp. 295-352.
14. A. V. KOSTOCHKA, Equitable colorings of outerplanar graphs, Discrete Math., 258 (2002), pp. 373-377.
15. A. V. KOSTOCHKA AND K. NAKPRASIT, Equitable colorings of k-degenerate graphs, Combin. Probab. Comput., 12 (2003), pp. 53-60.
16. S. V. PEMMARAJU, K. NAKPRASIT, AND A. V. KOSTOCHKA, Equitable colorings with constant number of colors, in Proceedings of the 14th Annual SIAM-ACM Symposium on Discrete Algorithms, SIAM, Philadelphia, ACM, New York, pp. 458-459.
17. A. V. KOSTOCHKA, M. J. PELSMAJER, AND D. B. WEST, A list analogue of equitable coloring, J. Graph Theory, 44 (2003), pp. 166-177.
18. J. KRARUP AND D. DE WERRA, Chromatic optimisation: Limitations, objectives, uses, references, European J. Oper. Res., 11 (1982), pp. 1-19.
19. K.-W. LIH AND P.-L. WU, On equitable coloring of bipartite graphs, Discrete Math., 151 (1996), pp. 155-160.
20. W. MEYER, Equitable Coloring, Amer. Math. Monthly, 80 (1973), pp. 143-149.
21. S. V. PEMMARAJU, Equitable colorings extend Chernoff-Hoeffding bounds, in Approximation, Randomization, and Combinatorial Optimization, Springer, Berlin, 2001, pp. 285-296.
22. S. V. PEMMARAJU, Coloring outerplanar graphs equitably, submitted. Available online at www.cs.uiowa.edu/~sriram/vita/vita.html.
23. B. F. SMITH, P. E. BJORSTAD, AND W. D. GROPP, Domain Decomposition. Parallel Multilevel Methods for Elliptic Partial Differential Equations, Cambridge University Press, Cambridge, UK, 1996.
24. A. TUCKER, Perfect graphs and an application to optimizing municipal services, SIAM Rev., 15 (1973), pp. 585-590.
25. H.-P. YAP AND Y. ZHANG, The equitable Δ-colouring conjecture holds for outerplanar graphs, Bull. Inst. Math. Acad. Sin., 25 (1997), pp. 143-149.
26. H.-P. YAP AND Y. ZHANG, Equitable colourings of planar graphs, J. Combin. Math. Combin. Comput., 27 (1998), pp. 97-105.