Generation of cubic graphs

Abstract

We describe a new algorithm for the efficient generation of all non-isomorphic connected cubic graphs. Our implementation of 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. © 2011 Discrete Mathematics and Theoretical Computer Science (DMTCS).