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.
| Original language | English |
|---|---|
| Pages (from-to) | 69-80 |
| Number of pages | 12 |
| Journal | Discrete Mathematics and Theoretical Computer Science |
| Volume | 13 |
| Issue number | 2 |
| Publication status | Published - 2011 |