Integer roots chromatic polynomials of non-chordal graphs and the Prouhet-Tarry-Escott prob\-lem
From MaRDI portal
Recommendations
- Non-chordal graphs having integral-root chromatic polynomials. II
- Chromatic roots and Hamiltonian paths
- scientific article; zbMATH DE number 1123787
- Chromatically equivalent class of certain graphs with integral-root polynomials
- The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots
Cites work
- Computational excursions in analysis and number theory
- scientific article; zbMATH DE number 4091530 (Why is no real title available?)
- scientific article; zbMATH DE number 3719177 (Why is no real title available?)
- scientific article; zbMATH DE number 1123787 (Why is no real title available?)
- Non-chordal graphs having integral-root chromatic polynomials. II
- The Prouhet-Tarry-Escott problem revisited
Cited in
(11)- Non-chordal graphs having integral-root chromatic polynomials. II
- The largest non-integer real zero of chromatic polynomials of graphs with fixed order
- The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots
- Graphs whose flow polynomials have only integral roots
- A dense set of chromatic roots which is closed under multiplication by positive integers
- scientific article; zbMATH DE number 1123787 (Why is no real title available?)
- The Prouhet-Tarry-Escott problem for Gaussian integers
- Newton polygons and the Prouhet-Tarry-Escott problem
- Chromatic roots at 2 and the Beraha number B10
- Newton polygons and the constant associated with the Prouhet-Tarry-Escott problem
- Ellipsoidal designs and the Prouhet-Tarry-Escott problem
This page was built for publication: Integer roots chromatic polynomials of non-chordal graphs and the Prouhet-Tarry-Escott prob\-lem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573804)