Gunnar Brinkmann ; Jan Goedgebeur ; Brendan D. Mckay - Generation of Cubic graphs

dmtcs:551 - Discrete Mathematics & Theoretical Computer Science, July 2, 2011, Vol. 13 no. 2 - https://doi.org/10.46298/dmtcs.551
Generation of Cubic graphsArticle

Authors: Gunnar Brinkmann 1; Jan Goedgebeur ORCID1; Brendan D. Mckay 2

  • 1 Department of Applied Mathematics and Computer Science [Ghent]
  • 2 Research School of Computer Science [Canberra]

Discrete Algorithms

[en]
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.

https://doi.org/10.46298/dmtcs.551
Source: HAL:hal-00990486v1
Volume: Vol. 13 no. 2
Section: Discrete Algorithms
Published on: July 2, 2011
Imported on: January 19, 2011
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

5 Documents citing this article

Share and export

Consultation statistics

This page has been seen 938 times.
This article's PDF has been downloaded 2367 times.