A note on the chromaticity of some 2-connected (n, n + 3)-graphs

Discrete Mathematics

Volumn 243, Issue 1-3, 2002, Pages 217-221

  Dong, F M ^a   Teo, K L ^b   Koh, K M ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b MASSEY UNIVERSITY   (New Zealand)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Chromatic polynomial; Chromatic uniqueness; Chromatically closed set; Chromatically equivalence class; Homeomorphism class

Indexed keywords

EID: 31244434891     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00217-5     Document Type: Article

References (6)

1. K.M. Koh, K.L. Teo, The search for chromatically unique graphs, Graphs Combin. 6 (1990) 259-285.
2. K.M. Koh, K.L. Teo, Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles, Discrete Math. 127 (1994) 243-258.
3. K.M. Koh, K.L. Teo, The search for chromatically unique graphs-II, Discrete Math. 172 (1997) 59-78.
4. N.Z. Li, Z.Z. Feng, Counterexamples against some families of chromatically unique graphs, to appear.
5. R.C. Read, W.T. Tutte, Chromatic polynomials, in: L.W. Beineke, RJ. Wilson (Eds.), Selected Topics in Graph Theory III, Academic Press, New York, 1988, pp. 15-42.
6. R.C. Read, E.G. Whitehead Jr., Chromatic polynomials of homeomorphism classes of graphs, Discrete Math. 204 (1999) 337-356.