Equitable colourings of d-degenerate graphs

Combinatorics Probability and Computing

Volumn 12, Issue 1, 2003, Pages 53-60

  Kostochka, A V ^a   Nakprasit, K ^a,b  

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

^b SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY; THEOREM PROVING;

CARDINALITY;

GRAPH THEORY;

EID: 0037255871     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548302005485     Document Type: Article

References (10)

1. Bollobás, B. and Guy, R. K. (1983) Equitable and proportional colorings of trees. J. Combin. Theory Ser. B 34 177-186.
2. Chen, B.-L., Lih, K.-W. and Wu, P.-L. (1994) Equitable coloring and the maximum degree. Europ. J. Combin. 15 443-447.
3. Hajnal, A. and Szemerédi, E. (1970) Proof of a conjecture of Erdos. In Combinatorial Theory and its Applications (A. Rényi and V. T. Sós, eds), Vol. II, North-Holland, Amsterdam, pp. 601-623.
4. Kostochka, A. V. Equitable colorings of outerplanar graphs. To appear in Discrete Math.
5. Lih, K.-W. (1998) The equitable coloring of graphs. In Handbook of Combinatorial Optimization (D.-Z. Du and P. Pardalos, eds), Vol. 3, Kluwer, Dordrecht, pp. 543-566.
6. Meyer, W. (1973) Equitable coloring. Amer. Math. Monthly 80 920-922.
7. Pemmaraju, S. V. (2001) Equitable colorings extend Chernoff-Hoeffding bounds. In Proc. 5th International Workshop on Randomization and Approximation Techniques in Computer Science: APPROX-RANDOM 2001, pp. 285-296.
8. Tucker, A. (1973) Perfect graphs and an application to optimizing municipal services. SIAM Review 15 585-590.
9. West, D. B. (2001) Introduction to Graph Theory, 2nd edn, Prentice-Hall, Upper Saddle River.
10. Yap, H. P. and Zhang, Y. (1997) The equitable Δ-coloring conjecture holds for outerplanar graphs. Bull. Inst. Math. Acad. Sinica 25 143-149.