Divisibility of certain coefficients of the chromatic polynomials

Discrete Mathematics

Volumn 275, Issue 1-3, 2004, Pages 311-317

  Dong, F M ^a   Koh, K M ^b   Soh, C A ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Broken cycle; Chromatic number; Chromatic polynomial; Fundamental reduction formula; Uniquely k colourable graph

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

CHROMATIC POLYNOMIALS; DIVISIBILITY;

POLYNOMIALS;

EID: 0347379689     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2003.05.007     Document Type: Article

References (6)

1. Eisenberg B. Characterization of a tree by means of coefficients of the chromatic polynomial. Trans. New York Acad. Sci. 34:1972;146-153.
2. Y. Hong, A note on the coefficients of chromatic polynomials, J. East China Norm. Univ. Natur. Sci. Ed. (4) (1984) 33-35 (Chinese).
3. Koh K.M., Teo K.L. The search for chromatically unique graphs. Graphs Combin. 6(3):1990;259-285.
4. Read R.C. An introduction to chromatic polynomials. J. Combin. Theory. 4:1968;52-71.
5. Read R.C., Tutte W.T. Chromatic polynomials. Beineke L.W., Wilson R.J. Selected Topics in Graph Theory III. 1988;15-42 Academic Press, New York.
6. Whitney H. A logic expansion in mathematics. Bull. Amer. Math. Soc. 38:1932;572-579.