Cubic graphs |
HomeAuthorGunnar Brinkmann |
Cubic graphsMinibaum is a generator for connected cubic graphs, but can be restricted to generating only graphs that have a fixed minimal girth or are bipartite. The algorithms used in the generator are described in:
The generator can be downloaded here and a short manual can be found here. Minibaum has been tested on Linux and Mac OS X. Installation instructions:
The number of cubic graphs can be found here. Note: A significantly faster generator called snarkhunter is available for the generation of cubic graphs with girth at least 3, 4, 5, 6 or 7 and for the generation of snarks. |