Equitable and m-bounded coloring of split graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1120, Issue , 1996, Pages 1-5

  Chen, Bor Liang ^a   Ko, Ming Tat ^b   Lih, Ko Wei ^c  

^a TUNGHAI UNIVERSITY   (Taiwan)

^b INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

^c INSTITUTE OF MATHEMATICS   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS;

BOUNDED COLORING; CHROMATIC NUMBER; EQUITABLE COLORING; PROPER COLORING; SPLIT GRAPHS;

COLORING;

EID: 84947927496     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61576-8_67     Document Type: Conference Paper

References (7)

1. Bollobás, B., Guy, R. K.: Equitable and proportional coloring of trees. J. Comb. Theory(B) 34 (1983) 177-186
2. Chen, B. L., Lih, K. W.: A note on the m-bounded chromatic number of a tree. Europ. J. Comb. 14 (1993) 311-322
3. Chen, B. L., Lih, K. W.: Equitable coloring of trees. J. Comb. Theory(B) 61 (1994) 83-87
4. Chen, B. L., Lih, K. W., Wu, P. L.: Equtiable coloring and the maximum degree. Europ. J. Comb. 15 (1994) 443-447
5. Hajnal, A., Szemerédi, E.: Proof of a conjecture of Erdös. In Combinatorial Theory and Its Applications. Vol II (P. Erdös, A Rényi and V. T. Sós, eds), Colloq. Math. Soc. János Bolyai 4, North-Holland, Amsterdam (1970) 601-623
6. Lih, K. W., Wu, P. L.: On equitable coloring of bipartite graphs. Discrete Math. (to appear)
7. Meyer, W.: Equitable coloring. Amer. Math. Monthly 80 (1973) 920-922