Extending results of Cayley, Kirchhoff and Tutte

In my overarching goal of classifying graphs of maximal complexity, lists of spanning trees that contain a specific forest in a graph play an important role. A generating function that accomplishes this is presented. The result generalizes some well-known classical theorems.