[1]
Bruijin, de, N. G. « Pólya’s Theory of Counting, » in Applied Combinatorial Mathematics, Beckenbach, E. F., éd. Wiley, New York, 1964.
Références 14.7 Références et lectures suggérées
[2]
Eidswick, J. A. « Cubelike Puzzles—What Are They and How Do You Solve Them? » American Mathematical Monthly 93 (1986), 157–76.
[3]
Harary, F., Palmer, E. M., and Robinson, R. W. « Pólya’s Contributions to Chemical Enumeration, » in Chemical Applications of Graph Theory, Balaban, A. T., éd. Academic Press, Londres, 1976.
[4]
Gårding, L. et Tambour, T. Algebra for Computer Science. Springer-Verlag, New York, 1988.
[5]
Laufer, H. B. Discrete Mathematics and Applied Modern Algebra. PWS-Kent, Boston, 1984.
[6]
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds. Springer-Verlag, New York, 1985.
[7]
Shapiro, L. W. « Finite Groups Acting on Sets with Applications, » Mathematics Magazine, mai–juin 1973, 136–47.
