A remark on the Whitney Broken Circuit Theorem

In the present note we show, via the connection between chromatic polynomial and Potts model, that the Whitney Broken circuit theorem is in fact a special case of a more general identity relating the chromatic polynomial of a graph G=(V,E) to sums over forests of G associated to some partition scheme in G.