Pages that link to "Item:Q2573804"

The following pages link to Integer roots chromatic polynomials of non-chordal graphs and the Prouhet-Tarry-Escott prob\-lem (Q2573804):

Displaying 10 items.

• A dense set of chromatic roots which is closed under multiplication by positive integers (Q394542) (← links)
• Newton polygons and the Prouhet-Tarry-Escott problem (Q503726) (← links)
• Non-chordal graphs having integral-root chromatic polynomials. II (Q1348126) (← links)
• The largest non-integer real zero of chromatic polynomials of graphs with fixed order (Q1827734) (← links)
• The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots (Q1841927) (← links)
• Graphs whose flow polynomials have only integral roots (Q2275472) (← links)
• (Q4379744) (← links)
• The Prouhet-Tarry-Escott problem for Gaussian integers (Q4912020) (← links)
• Chromatic roots at 2 and the Beraha number B10 (Q5066931) (← links)
• Newton polygons and the constant associated with the Prouhet-Tarry-Escott problem (Q6547202) (← links)