The first part was a generalisation of the Chromatic Function on graphs to provide information of the "Shapes" of colourings, and not just the number.
The second part showed that a plausible (hand-wave hand-wave) location for a counter-example to an open conjecture about partially-ordered sets did not, in fact, hold a counter-example. In other words, I proved a special case of an open conjecture on posets.
More details on request.
So if there is a colouring of $G$ using $n$ colours with induced sets of size 4, 4, 2, and 1, then the function evaluated at $n$ included P_3^2 P_1 P_0.
(The "-1" is a technical thing that only feels obvious once you've played with it enough).
You end up with what the values should be, but the clever part was using "umbral evaluation" on the polynomial, and not just simple substitution. It might be possible to find the details on the web, but this was 35 years ago.
I'd be interested in learning more about your invariant. Do you have a copy of your thesis anywhere?
Email(s) in my profile.