REFERENCES
- G. L. Alexanderson and L. H. Lange, Obituary of George Pólya, Bull. London Math. Soc., 19 (1987) 559–608.
- N. G. de Bruijn, Generalization of Pólya's fundamental theorem in enumeration combinatorial analysis, Indagationes Math., 21 (1959) 59–69.
- F. Harary, The number of linear, directed, rooted, and connected graphs, Trans. Amer. Math. Soc., 78 (1955) 445–463.
- F. Harary, Exponentiation of permutation groups, Amer. Math. Monthly, 66 (1959) 572–575.
- F. Harary, The determinant of the adjacency matrix of a graph, SIAM Review, 4 (1962) 202–210.
- F. Harary, Homage to George Pólya, J. Graph Theory, 1 (1977) 289–290.
- F. Harary and E. M. Palmer, The power group enumeration theorem, J. Combinatorial Theory, 1 (1966) 157–173.
- G. Pólya, Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen, Acta Math., 68 (1937) 145–254.
- G. Pólya and G. Szegö, Aufgaben und Lehrsätze aus der Analysis, 2 vol. Springer, Berlin (1925).
- J. H. Redfield, The theory of group-reduced distributions, Amer. J. Math., 49 (1927) 433–455.