An attempt to classify bipartite graphs by chromatic polynomials

Discrete Mathematics

Volumn 222, Issue 1-3, 2000, Pages 73-88

  Dong, F M ^a   Koh, K M ^b   Teo, K L ^a   Little, C H C ^a   Hendy, M D ^a  

^a MASSEY UNIVERSITY   (New Zealand)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Bipartite graphs; Chromatic equivalence; Chromatic polynomials

Indexed keywords

EID: 0345754953     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00007-8     Document Type: Article

References (3)

1. F.M. Dong, K.M. Koh, K.L. Teo, C.H.C. Little, M.D. Hendy, Sharp bounds for the number of 3-partitions and the chromaticity of bipartite graphs, submitted.
2. F.M. Dong, K.M. Koh, K.L. Teo, C.H.C. Little, M.D. Hendy, Chromatically unique bipartite graphs with lower 3-independent partition numbers, submitted.
3. R.C. Read, W.T. Tutte, Chromatic polynomials, in: L.W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory III, Academic Press, New York, 1988, pp. 15-42.