Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990486
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, May 13, 2014 - 3:39:14 PM
Last modification on : Wednesday, November 3, 2021 - 2:56:49 PM
Long-term archiving on: : Monday, April 10, 2017 - 10:25:59 PM

File

1801-6352-1-PB.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Gunnar Brinkmann, Jan Goedgebeur, Brendan D. Mckay. Generation of Cubic graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2011, Vol. 13 no. 2 (2), pp.69--79. ⟨10.46298/dmtcs.551⟩. ⟨hal-00990486⟩

Share

Metrics

Record views

172

Files downloads

2999