Generating cubic graphs faster than isomorphism checking

In this paper an easy programmable, but nevertheless very efficient method to generate regular graphs shall be presented. This method seems to be applicable in a lot of cases where the aim is to enumerate combinatorial structures. In the second part an improvement of the method is given that needs a bit more programming effort. It reduces the growth of the computation time enough to be below two natural benchmarks: 1. If N(n) denotes the number of pairwise non isomorphic cubic graphs with n vertices and T(t) the time needed for generating the list, then - at least in the observed cases - T(n) grows slower than N(n). 2. For large lists (n#>=#22) there seems to be no possibility to check a list of N(n) graphs for being pairwise non-isomorphic in the same time needed for generating the list. (orig.)SIGLEAvailable from TIB Hannover: RO 8278(92-047) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman