Skip navigation
Skip navigation

Generation of Cubic Graphs

Brinkmann, Gunnar; Goedgebeur, Jan; McKay, Brendan

Description

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.

CollectionsANU Research Publications
Date published: 2011
Type: Journal article
URI: http://hdl.handle.net/1885/59131
Source: Discrete Mathematics and Theoretical Computer Science (DMTCS)

Download

File Description SizeFormat Image
01_Brinkmann_Generation_of_Cubic_Grap_2011.pdf277.12 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator