Séminaire Lotharingien de Combinatoire, B14Sh (1986), p.
56-59.
Adalbert Kerber
On the Basic Problem of Pólya's Theory of Enumeration
Abstract.
The problem which stimulated
Pólya to develop what now is called his theory of enumeration,
and which is in fact a
very interesting particular case of the theory of enumeration
under finite group action, reads therefore as follows: Enumerate,
classify and construct graphs with certain conditions (like
degree sequence, certain subgraphs etc. ).
We describe several approaches towards solutions of such problems.
The following version is available: