Chromatically equivalent class of certain graphs with integral-root polynomials

MaRDI QIDQ2858706zbMATH OpenFDO

Authors Helin Gong, Qing Shu, Yongming Li

Publication date 19 November 2013

Published in Journal of Anhui University. Natural Science Edition (Search for Journal in Brave)

zbMATH Keywords

chordal graphchromatic polynomialchromatical equivalencetwo-tree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Two families of integral-root chromatic polynomials
• Integral-root polynomials and chromatic uniqueness of graphs
• scientific article; zbMATH DE number 1123787
• scientific article; zbMATH DE number 2199828
• Non-chordal graphs having integral-root chromatic polynomials. II

Cited in

(9)

• Non-chordal graphs having integral-root chromatic polynomials. II
• The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots
• Integer roots chromatic polynomials of non-chordal graphs and the Prouhet-Tarry-Escott prob\-lem
• scientific article; zbMATH DE number 4095494 (Why is no real title available?)
• scientific article; zbMATH DE number 1123787 (Why is no real title available?)
• scientific article; zbMATH DE number 1880735 (Why is no real title available?)
• Integral-root polynomials and chromatic uniqueness of graphs
• Two families of integral-root chromatic polynomials
• The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than -4

This page was built for publication: Chromatically equivalent class of certain graphs with integral-root polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2858706)