Bounds for mean colour numbers of graphs

Journal of Combinatorial Theory. Series B

Volumn 87, Issue 2, 2003, Pages 348-365

  Dong, F M ^a,b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b FUJIAN NORMAL UNIVERSITY   (China)

Author keywords

Chromatic polynomial; Graph; Mean colour number

Indexed keywords

EID: 0037374034     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0095-8956(02)00023-0     Document Type: Article

References (8)

1. J.E. Bartels, D.J.A. Welsh, The Markov chain of colourings, in: Proceedings of the Fourth Conference on Integer Programming and Combinatorial Optimization (IPCO IV), Lecture Notes in Computer Science, Vol. 920, Springer, New York/Berlin, 1995, pp. 373-387.
2. R. Diestel, Graph Theory, Springer, Berlin, 1991.
3. F.M. Dong, Proof of a chromatic polynomial conjecture, J. Combin. Theory Ser. B 78 (2000) 35-44.
4. F.M. Dong, Further results on mean colour numbers, J. Graph Theory, submitted for publication.
5. F.M. Dong, K.L. Teo, C.H.C. Little, M.D. Hendy, Some inequalities on chromatic polynomials, New Zealand J. Math. 30 (2001) 111-118.
6. Michele Mosca, Removing edges can increase the average number of colours in the colourings of a graph, Combin. Probab. Comput. 7 (1998) 211-216.
7. 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.
8. N. Robertson, P.D. Seymour, Graph minors. III. Planar tree-width, J. Combin. Theory Ser. B 36 (1984) 49-64.