References

Bg

J. Biegholdt :
Computerunterstützte Berechnung von Multigraphen mittels Homomorphieprinzip Diplomarbeit, Universität Bayreuth, 1995

Br

G. Brinkmann :
Generating cubic graphs faster than isomorphism checking preprint 92-047, Sonderforschungsbereich 343, Universität Bielefeld, 1992

BFP

C.A. Brown, C. Finkelstein, P.W. Purdom :
A new basechange algorithm for permutation groups. SIAM J. Computing, Vol.18, 1989, pp.1037-1047

F

I.A. Faradzhev :
Generation of nonisomorphic graphs with a given degree sequence Algorithmic Studies in Combinatorics, Nauka, Moscow, 1978, pp.11-19

Go

L.A. Goldberg :
Efficient algorithms for listing unlabeled graphs. J. Algorithms, Vol.13, 1992, pp.128-143

Gr

Th. Grüner :
Ein neuer Algorithmus zur rekursiven Erzeugung von Graphen Diplomarbeit, Universität Bayreuth, 1995

Gd

R. Grund :

Konstruktion molekularer Graphen mit gegebenen Hybridisierungen und überlappungsfreien Fragmenten.
Bayreuther Math. Schr., Vol.49, 1995, pp.1-113

GKL

R. Grund, A. Kerber, R. Laue :
Construction of discrete structures, especially of chemical isomers. to appear in Discrete Applied Mathematics.

GKLM

R. Grund, A. Kerber, R. Laue :
MOLGEN, ein Computeralgebra-System für die Konstruktion molekularer Graphen. Communications in mathematical chemistry(Match), Vol.27, 1992, pp.87-131

HKLMW

R. Hager, A. Kerber, R. Laue, D. Moser, W. Weber :
Construction of orbit representatives. Bayreuther Math. Schr., Vol.35, 1991, pp.157-169

H

S.L. Hakimi :
On realizability of a set of integers as degrees of the vertices of a linear graph I. SIAM J. Appl. Math., Vol.10, 1962, pp.496-506

K

A. Kerber :
Algebraic combinatorics via finite group actions BI Wissenschaftsverlag, 1991, Mannheim

KP

V. Kvasnicka, J. Pospichal :
Canonical indexing and the constructive enumeration of molecular graphs J. Chem. Computer Science, Vol.30, 1990, pp.99-105

L

R. Laue :
Construction of combinatorial objects, a tutorial Bayreuther Math. Schr., Vol.43, 1993, 53-96

LBFL

R.K. Lindsay, B.G. Buchanan, E.A. Feigenbaum, J. Lederberg :
Applications of artificial intelligence for organic chemistry: The Dendral Project. McGraw-Hill, New York, 1980

McKa

B.D. McKay :
Practical graph isomorphism Congressus Numerantium, Vol.30, 1981, pp.45-87

McKb

B.D. McKay :
private communication

M

M. Meringer :
Erzeugung regulärer Graphen Diplomarbeit, Universität Bayreuth, 1996

Mo

S.G. Molodtsov :
Computer-Aided generation of molecular graphs Commun. in Math. Chem. (MATCH), Vol.30, 1994, pp.213-224

O

W. Oberschelp :
Die Anzahl nicht-isomorpher m-Graphen Monatshefte für Mathematik, Vol.72, 1968, pp.220-223

R

R.C. Read :
Every one a winner Annals of Discrete Math., Vol.2, 1978, pp.107-120

SW

D. Stanton, D. White :
Constructive Combinatorics Springer Verlag New-York, Berlin, Heidelberg, Tokyo, 1986

vLW

J.H. van Lint, R.M. Wilson :
A course in combinatorics Cambridge University Press, 1992

Wi

H.S. Wilf :
What is an answer? Amer. Math. Monthly, Vol.89, 1982, pp.289-29