Enumeration of Cubic Graphs by Inclusion–Exclusion

We use the principle of inclusion and exclusion to enumerate labeled cubic graphs, without resort to the superposition theory of Read. This work was motivated by the cubic array representation of cubic graphs in the studies of generating functions of 3n−jcoefficients in angular momentum theory.