| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651053 | Discrete Mathematics | 2007 | 10 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Halina Bielak,