References

References

 [1]

A. Betten. Gruppenaktionen auf Verbänden und die Konstruktion kombinatorischer Objekte. Master's thesis, Universität Bayreuth, June 1995.

 [2]

C.J. Colbourn and R.C. Read. Orderly algorithms for generating restricted classes of graphs. Journal of Graph Theory, 3:187 - 195, 1979.

 [3]

J.D. Dixon and H.S. Wilf. The random selection of unlabeled graphs. Journal of Algorithms, 4:205 - 213, 1983.

 [4]

P.W. Fowler and D.B. Redmond. Symmetry aspects of leapfrog and truncated polyhedra. match, 33:101-119, 1996. ISSN 0340-6253.

 [5]

P.W. Fowler and J.I. Steer. The Leapfrog Principle: A Rule for Electron Counts of Carbon Clusters. Journal of the Chemical Society, Chemical Communications, pages 1403 - 1405, 1987.

 [6]

H. Fripertinger. The 3-dimensional cycle index of the leapfrog of a polyhedron. Accepted for Publication in J. Chem. Inf. Comp. Sci.

 [7]

H. Fripertinger. Cycle indices of linear, affine and projective groups. To appear in the Journal of Linear Algebra and Its Applications.

 [8]

H. Fripertinger. Enumeration, construction and random generation of block codes. Submitted to Designs, Codes and Cryptography.

 [9]

H. Fripertinger. Enumeration in Musical Theory. Séminaire Lotharingien de Combinatoire, 476/S-26:29 - 42, 1992. ISSN 0755-3390.

 [10]

H. Fripertinger. Endliche Gruppenaktionen in Funktionenmengen. Das Lemma von Burnside -- Repräsentantenkonstruktionen -- Anwendungen in der Musiktheorie. PhD thesis, Karl-Franzens-Universität Graz, 1993.

 [11]

H. Fripertinger. The Cycle Index of the Symmetry Group of the Fullerene C₆₀. match, 33:121-138, 1996.

 [12]

H. Fripertinger. Enumeration of Linear Codes by Applying Methods from Algebraic Combinatorics. Grazer Math. Berichte, 328:31 - 42, 1996.

 [13]

H. Fripertinger and P. Schöpf. Endofunctions of given cycle-type. Submitted to The Annales des Sciences Mathematiques du Quebec.

 [14]

R. Grund. Symmetrieklassen von Abbildungen und die Konstruktion von diskreten Strukturen. Bayreuther Mathematische Schriften, 31:19 - 54, 1990. ISSN 0172-1062.

 [15]

M.A. Harrison. Counting Theorems and their Applications to Switching Theory. In A. Mukhopadyay, editor, Recent Developments in Switching Functions, chapter 4, pages 85 - 120. Academic Press, 1971.

 [16]

M.A. Harrison and R.G. High. On the Cycle Index of a Product of Permutation Groups. Journal of Combinatorial Theory, 4:277 - 299, 1968.

 [17]

A. Joyal. Une théorie combinatoire des séries formelles. Advances in Mathematics, 42:1 - 82, 1981.

 [18]

G. Mazzola. Geometrie der Töne. Birkhäuser, Basel, Boston, Berlin, 1990. ISBN 3-7643-2353-1.

 [19]

R.C. Read. Every one a winner. Ann. Discrete Mathematics, 2:107 - 120, 1978.

 [20]

J.H. Redfield. The Theory of Group - Reduced Distributions. American J. Math., 49:433 - 455, 1927.

 [21]

C.C. Sims. Computational methods in the study of permutation groups. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 169 - 183. Pergamon Press, 1970.

 [22]

C.C. Sims. Computation with Permutation Groups. In S.R. Petrick, editor, Proceedings of the Second Symposium on Symbolic and Algebraic Manipulation, pages 23 - 28. Assoc. Comput. Mach., 1971.

 [23]

D. Slepian. On the Number of Symmetry Types of Boolean Functions of n Variables. Canad. J. Math., 5:185 - 193, 1953.

 [24]

M. Wild. Enumeration of binary and ternary matroids and other applications of the Brylawski-Lucas-Theorem. Preprint 1693, Technische Hochschule Darmstadt, November 1994.

 [25]

M. Wild. Consequences of the Brylawski-Lucas-Theorem for Binary Matroids. Europ. J. Combinatorics, 17:309-316, 1996.

References