On Some Structural Properties of Fullerene Graphs

We show how some important structural properties of general fullerene graphs follow from the recently proved fact that all fullerene graphs are cyclically 4-edge connected. These properties, in turn, give us upper and lower bounds for various graph invariants. In particular, we establish the best currently known lower bound for the number of perfect matchings in fullerene graphs.