Generation of Cubic Graphs
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.
|Collections||ANU Research Publications|
|Source:||Discrete Mathematics and Theoretical Computer Science (DMTCS)|
|Access Rights:||Open Access|
|01_Brinkmann_Generation_of_Cubic_Grap_2011.pdf||277.12 kB||Adobe PDF|