# Chromatic properties of hamiltonian graphs

@article{Bielak2007ChromaticPO, title={Chromatic properties of hamiltonian graphs}, author={Halina Bielak}, journal={Discrete Mathematics}, year={2007}, volume={307}, pages={1245-1254} }

- Published 2007 in Discrete Mathematics
DOI:10.1016/j.disc.2005.11.061

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

#### Citations

##### Publications citing this paper.

Showing 1-3 of 3 extracted citations

## On uniquely Hamiltonian claw-free and triangle-free graphs

View 4 Excerpts

Highly Influenced

## What is on his mind?

View 1 Excerpt

#### References

##### Publications referenced by this paper.

Showing 1-7 of 7 references

## On the Number of Hamiltonian Cycles in Bipartite Graphs

View 16 Excerpts

Highly Influenced

## The largest real zero of the chromatic polynomial

View 4 Excerpts

Highly Influenced

## An introduction to chromatic polynomials

View 4 Excerpts

Highly Influenced

## Chromatic Roots and Hamiltonian Paths

View 3 Excerpts

## A zero-free interval for chromatic polynomials

View 2 Excerpts

## An inequality for chromatic polynomials

View 2 Excerpts