On equitable coloring of bipartite graphs

Discrete Mathematics

Volumn 151, Issue 1-3, 1996, Pages 155-160

  Lih, Ko Wei ^a   Wu, Pou Lin ^b  

^a INSTITUTE OF MATHEMATICS   (Taiwan)

^b LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012913308     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(94)00092-W     Document Type: Article

References (6)

1. R.L. Brooks, On colouring the nodes of a network, Proc. Cambridge Philos. Soc. 37 (1941) 194-197.
2. B.-L. Chen and K.-W. Lih, Equitable coloring of trees, J. Combin. Theory Ser. B 61 (1994) 83-87.
3. R.K. Guy, Monthly research problems, 1969-1975, Amer. Math. Monthly 82 (1975) 995-1004.
4. A. Hajnal and E. Szemerédi, Proof of a conjecture of Erdos, in: P. Erdos, A. Rényi and V.T. Sós, eds., Combinatorial Theory and Its Applications, Vol. II, Colloq. Math. Soc. János Bolyai 4 (North-Holland, Amsterdam, 1970) 601-623.
5. W. Meyer, Equitable coloring, Amer. Math. Monthly 80 (1973) 920-922.
6. B. Toft, 75 graph-colouring problems, in: R. Nelson and R.J. Wilson, eds., Graph Colourings (Longman, Essex, 1990) 9-36.