Chromatically unique bipartite graphs with low 3-independent partition numbers

Discrete Mathematics

Volumn 224, Issue 1-3, 2000, Pages 107-124

  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 graph; Chromatic polynomial

Indexed keywords

EID: 0347646819     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00094-7     Document Type: Article

References (6)

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. R.E. Giudici, E. Lima de Sa, Chromatic uniqueness of certain bipartite graphs, Congr. Numer. 76 (1990) 69-75.
3. K.M. Koh, K.L. Teo, The search for chromatically unique graphs, Graphs Combin. 6 (1990) 259-285.
4. K.M. Koh, K.L. Teo, The search for chromatically unique graphs - II, Discrete Math. 172 (1997) 59-78.
5. R.C. Read, W.T. Tutte, Chromatic polynomials, in: L.W. Beineke, RJ. Wilson (Eds.), Selected Topics in Graph Theory, Vol. 3, Academic Press, New York, 1988, pp. 15-42.
6. C.P. Teo, K.M. Koh, The chromaticity of complete bipartite graphs with at most one edge deleted, J. Graph Theory 14 (1990) 89-99.