Generation of cubic graphs and snarks with large girth

Gunnar Brinkmann, Jan Goedgebeur

We describe two new algorithms for the generation of all non-isomorphic cubic graphs with girth at least $k\ge 5$ which are very efficient for $5\le k\le 7$ and show how these alg…