Chromatic roots and hamiltonian paths

Journal of Combinatorial Theory. Series B

Volumn 80, Issue 2, 2000, Pages 218-224

  Thomassen, C ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034311662     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2000.1976     Document Type: Article

References (7)

1. Bondy J. A., Murty U. S. R. Graph Theory with Applications. 1976;Macmillan and Co. London.
2. Garey M. R., Johnson D. S. Computers and Intractability, A guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco.
3. Jackson B. A zero-free interval for chromatic polynomials of graphs. Combin., Probab., Comput. 2:1993;325-336.
4. Read R. C., Tutte W. T. Chromatic polynomials. Beineke L. W., Wilson R. M. Selected Topics in Graph Theory. 1988;15-42 Academic Press, New York.
5. Stanley R. P. Enumerate Combinatorics. 1986;Wadsworth and Brooks/Cole, Montery.
6. Thomassen C. On the number of hamiltonian cycles in bipartite graphs. Combin. Probab. Comput. 5:1996;437-442.
7. Thomassen C. The zero-free intervals for chromatic polynomials of graphs. Combin. Probab. Comput. 6:1997;497-506.