Pages that link to "Item:Q1569069"

The following pages link to Proof of a chromatic polynomial conjecture (Q1569069):

Displaying 17 items.

• Chromatic polynomials of simplicial complexes (Q295259) (← links)
• On Brenti's conjecture about the log-concavity of the chromatic polynomial (Q449211) (← links)
• Proof of a conjectured lower bound on the chromatic number of a graph (Q745214) (← links)
• The chromatic polynomial and list colorings (Q1003851) (← links)
• Two chromatic polynomial conjectures (Q1369659) (← links)
• Bounds to the chromatic polynomial of a graph (Q1384128) (← links)
• Bounds for mean colour numbers of graphs (Q1405125) (← links)
• A note on the shameful conjecture (Q1631622) (← links)
• On the chromatic polynomial of a graph (Q1849500) (← links)
• Mean color numbers of some graphs (Q2062899) (← links)
• Some inequalities on chromatic polynomials (Q2778264) (← links)
• A proof from The Book: a lower bound for the polychromatic number of the plane (Q2869398) (← links)
• (Q3484859) (← links)
• New results in near-chromatic polynomials (Q3976599) (← links)
• Problems on chromatic polynomials of hypergraphs (Q4957990) (← links)
• The chromatic polynomial for cycle graphs (Q5204511) (← links)
• Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations (Q6055397) (← links)