The Fifth and Sixth Coefficients of the Characteristic Polynomial of a Graph

It is well known that the coefficients of the characteristic polynomial of a graph G are determined by the elementary subgraphs of G; in particular there are simple expressions for the four higest coefficients. Here we use an enumeration of elementary subgraphs called k-matchings to obtain expressions for the next two coefficients.