Integer Roots Chromatic Polynomials of Non-Chordal Graphs and the Prouhet-Tarry-Escott Problem
- Cite this article as:
- Hernández, S. & Luca, F. Graphs and Combinatorics (2005) 21: 319. doi:10.1007/s00373-005-0617-0
- 73 Downloads
In this paper, we give an affirmative answer to a question of Dmitriev concerning the existence of a non-chordal graph with a chordless cycle of order n whose chromatic polynomial has integer roots for a few values of n, extending prior work of Dong et al.