Chromatic polynomials and bialgebras of graphs

Abstract: The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a contraction-extraction process. This gives Hopf-algebraic proofs of Rota's result on the signs of coefficients of chromatic polynomials and of Stanley's interpretation of the values at negative integers of chromatic polynomi-als. We also give non-commutative version of this construction, replacing graphs by indexed graphs and Q[X] by the Hopf algebra WSym of set partitions.