Non-chordal graphs having integral-root chromatic polynomials. II

DOI10.1016/S0012-365X(01)00307-7zbMath0996.05051OpenAlexW2127466064MaRDI QIDQ1348126

Michael D. Hendy, Khee Meng Koh, Kee L. Teo, Fengming Dong

Publication date: 15 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00307-7

zbMATH Keywords

chromatic polynomialchordal graphschordless cyclesinteger roots

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

On graphs whose flow polynomials have real roots only ⋮ A dense set of chromatic roots which is closed under multiplication by positive integers ⋮ Several improved asymptotic normality criteria and their applications to graph polynomials ⋮ Algebraic properties of chromatic roots ⋮ Graphs whose flow polynomials have only integral roots ⋮ Integer roots chromatic polynomials of non-chordal graphs and the Prouhet-Tarry-Escott prob\-lem

This page was built for publication: Non-chordal graphs having integral-root chromatic polynomials. II