Some results on the maximal chromatic polynomials of $2$-connected $k$-chromatic graphs

Yan Yang

In 2015, Brown and Erey conjectured that every $2$-connected graph $G$ on $n$ vertices with chromatic number $k\ge 4$ has at most $(x-1{)}_{k-1}((x-1{)}^{n-k+1}+(-1{)}^{n-k})$ p…