chromatic polynomials;
Hamiltonian graph;
Hamiltonian path;
zeros of chromatic polynomials;
D O I:
10.1016/j.disc.2005.11.061
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We study the problem of the location of real zeros of chromatic polynomials for some families of graphs. In particular, a problem presented by Thomassen (see [On the number of hamiltonian cycles in bipartite graphs, Combin. Probab. Comput. 5 (1996) 437-442.]) is discussed and a result for hamiltonian graphs is presented. An open problem is stated for 2-connected graphs with a hamiltonian path. (c) 2006 Elsevier B.V. All rights reserved.