Non-chordal graphs having integral-root chromatic polynomials II

Discrete Mathematics

Volumn 245, Issue 1-3, 2002, Pages 247-253

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

^a MASSEY UNIVERSITY   (New Zealand)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Chordal graphs; Chromatic polynomials

Indexed keywords

EID: 31244435983     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00307-7     Document Type: Article

References (10)

1. K. Braun, M. Kretz, B. Walter, M. Walter, Die chromatischen polynôme untemngfreier graphen, Manuscripta Math. 14 (1974) 223-234.
2. O.D'antona, C. Mereghetti, F. Zamparini, The 224 Non-chordal graphs on less than 10 vertices whose chromatic polynomial has no complex roots, Draft, 1998.
3. I.G. Dmitriev, Weakly cyclic graphs with integral chromatic number (in Russian), Melody Diskret. Analiz. 34 (1980) 3-7.
4. P.M. Dong, K.M. Koh, Non-chordal graphs having integral-root chromatic polynomials, Bull. Combin. Appl. 22 (1998) 67-77.
5. R.C. Read, An introduction to chromatic polynomials, J. Combin. Theory 4 (1968) 52-71.
6. R.C. Read, Review, Math. Rev. 50 (6909) (1975).
7. R.C. Read, A large family of chromatic polynomials, Proceedings of the third Caribbean Conference on Combinatorics and Computing, Barbados, 1981.
8. R.C. Read, W.T. Tutte, Chromatic polynomials, Selected Topics in Graph Theory 3, Academic Press, New York, 1988, pp. 15-42.
9. P. Vaderlind, Chromaticity of triangulated graphs, J. Graph Theory 12 (1988) 245-248.
10. Vitaly I. Voloshin, Huishan Zhou, Pseudo-chordal mixed hypergraphs, Discrete Math. 202 (1999) 239-248.