Graphs and Combinatorics

, Volume 21, Issue 3, pp 319-323

Integer Roots Chromatic Polynomials of Non-Chordal Graphs and the Prouhet-Tarry-Escott Problem

  • Santos HernándezAffiliated withMathematical InstituteFacultad de Matemáticas, Pontificia Universidad Católica de Chile
  • , Florian LucaAffiliated withMathematical Institute

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.


Chromatic polynomials of graphs the Prouhet-Tarry-Escott problem