Geodesic
On the Basic Problem of Pólya's Theory of Enumeration
Séminaire lotharingien de combinatoire, 14s (1986) 
Adalbert Kerber. On the Basic Problem of Pólya's Theory of Enumeration. Séminaire lotharingien de combinatoire, 14s (1986). http://geodesic.mathdoc.fr/item/SLC_1986_14s_a7/
@article{SLC_1986_14s_a7,
     author = {Adalbert Kerber},
     title = {On the {Basic} {Problem} of {P\'olya's} {Theory} of {Enumeration}},
     journal = {S\'eminaire lotharingien de combinatoire},
     year = {1986},
     volume = {14s},
     url = {http://geodesic.mathdoc.fr/item/SLC_1986_14s_a7/}
}
TY  - JOUR
AU  - Adalbert Kerber
TI  - On the Basic Problem of Pólya's Theory of Enumeration
JO  - Séminaire lotharingien de combinatoire
PY  - 1986
VL  - 14s
UR  - http://geodesic.mathdoc.fr/item/SLC_1986_14s_a7/
ID  - SLC_1986_14s_a7
ER  - 
%0 Journal Article
%A Adalbert Kerber
%T On the Basic Problem of Pólya's Theory of Enumeration
%J Séminaire lotharingien de combinatoire
%D 1986
%V 14s
%U http://geodesic.mathdoc.fr/item/SLC_1986_14s_a7/
%F SLC_1986_14s_a7

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

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.