Graphs with chromatic roots in the interval (1,2)

Electronic Journal of Combinatorics

Volumn 14, Issue 1 N, 2007, Pages

  Royle, Gordon F ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34548587806     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1019     Document Type: Article

References (6)

1. Dong, F. M., and Koh, K. M. On graphs having no chromatic zeros in (1,2). SIAM J. Discrete Math. 20, 3 (2006), 799-810 (electronic).
2. Dong, F. M., Koh, K. M., and Teo, K. L. Chromatic polynomials and chromaticity of graphs. World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2005.
3. Jackson, B. A zero-free interval for chromatic polynomials of graphs. Combin. Probab. Comput. 2, 3 (1993), 325-336.
4. Jackson, B. Zeros of chromatic and flow polynomials of graphs. J. Geom. 76, 1-2 (2003), 95-109. Combinatorics, 2002 (Maratea).
5. Thomassen, C. On the number of Hamiltonian cycles in bipartite graphs. Combin. Probab. Comput. 5, 4 (1996), 437-442.
6. Thomassen, C. Chromatic roots and Hamiltonian paths. J. Combin. Theory Ser. B 80, 2 (2000), 218-224.