Two results on real zeros of chromatic polynomials

Combinatorics Probability and Computing

Volumn 13, Issue 6, 2004, Pages 809-813

  Dong, F M ^a   Koh, K M ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMATIC POLYNOMIALS; REAL ZEROS;

GRAPH THEORY; INTEGER PROGRAMMING; THEOREM PROVING; TREES (MATHEMATICS);

POLYNOMIALS;

EID: 9744246876     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548304006418     Document Type: Article

References (4)

1. Dong, F. M. (2000) Proof of a chromatic polynomial conjecture. J. Combin. Theory Ser. B 78 35-44.
2. Oxlcy, J. (1978) Colouring, packing and critical problem. Quart. J. Math. Oxford Ser. 29 11-22.
3. Read. R. C. and Tutte. W. T. (1988) Chromatic polynomials. In Selected Topics in Graph Theory III (L. W. Beineke and R. J. Wilson, eds). Academic Press, New York, pp. 15-42.
4. Sokal, A. D. (2001) Bounds on the complex zeros of (Di)chromatic polynomials and Potts-model partition functions. Combin. Probab. Comput. 10 41-77.