Chromatic properties of hamiltonian graphs

  title={Chromatic properties of hamiltonian graphs},
  author={Halina Bielak},
  journal={Discrete Mathematics},
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. © 2006 Elsevier B.V. All rights reserved. MSC: 05C15 

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-3 of 3 extracted citations

On uniquely Hamiltonian claw-free and triangle-free graphs

Discussiones Mathematicae Graph Theory • 2015
View 4 Excerpts
Highly Influenced

What is on his mind?

Discrete Mathematics • 2010
View 1 Excerpt


Publications referenced by this paper.
Showing 1-7 of 7 references

On the Number of Hamiltonian Cycles in Bipartite Graphs

Combinatorics, Probability & Computing • 1996
View 16 Excerpts
Highly Influenced

The largest real zero of the chromatic polynomial

Discrete Mathematics • 1997
View 4 Excerpts
Highly Influenced

An introduction to chromatic polynomials

R. C. Read
J. Combin. Theory 4 • 1968
View 4 Excerpts
Highly Influenced

Chromatic Roots and Hamiltonian Paths

J. Comb. Theory, Ser. B • 2000
View 3 Excerpts

A zero-free interval for chromatic polynomials

Discrete Mathematics • 1992
View 2 Excerpts

An inequality for chromatic polynomials

Discrete Mathematics • 1992
View 2 Excerpts

Similar Papers

Loading similar papers…