Discrete Mathematics & Theoretical Computer Science, Vol 13, No 2 (2011)

Font Size:  Small  Medium  Large

Generation of Cubic graphs

Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay


We describe a new algorithm for the efficient generation of all non-isomorphic connected cubic graphs. A program based on this algorithm is more than 4 times faster than previous generators. The generation can also be efficiently restricted to cubic graphs with girth at least 4 or 5.

Full Text: PDF PostScript