Coefficients of chromatic polynomials

Abstract A bound is obtained for the coefficients of the chromatic polynomial of a graph and some relations are obtained connecting these coefficients with the number of circuits of minimal length.