Non-chordal graphs having integral-root chromatic polynomials II

It is known that the chromatic polynomial of any chordal graph has only integer roots. However, there also exist non-chordal graphs whose chromatic polynomials have only integer roots. Dmitriev asked in 1980 if for any integer p

• Type: Journal
• Year: 2002
• Where: DM
• Authors: Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy
• Keywords: Chordless Cycles, Chromatic Polynomial, DM 2002, Integer Roots