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.

dc.contributor.authorBrinkmann, Gunnar
dc.contributor.authorGoedgebeur, Jan
dc.contributor.authorMcKay, Brendan
dc.date.accessioned2015-12-10T22:51:38Z
dc.identifier.issn1365-8050
dc.identifier.urihttp://hdl.handle.net/1885/59131
dc.description.abstractWe 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.
dc.publisherDMTCS
dc.rightsAuthor/s retain copyright
dc.sourceDiscrete Mathematics and Theoretical Computer Science (DMTCS)
dc.subjectKeywords: Canonical construction path; Cubic graph; Generation; Graph; Algorithms Canonical construction path; Cubic graph; Generation; Graph
dc.titleGeneration of Cubic Graphs
dc.typeJournal article
local.description.notesImported from ARIES
local.identifier.citationvolume13
dc.date.issued2011
local.identifier.absfor080202 - Applied Discrete Mathematics
local.identifier.ariespublicationU3594520xPUB475
local.type.statusPublished Version
local.contributor.affiliationBrinkmann, Gunnar, Ghent University
local.contributor.affiliationGoedgebeur, Jan, Ghent University
local.contributor.affiliationMcKay, Brendan, College of Engineering and Computer Science, ANU
local.bibliographicCitation.issue2
local.bibliographicCitation.startpage69
local.bibliographicCitation.lastpage80
dc.date.updated2016-02-24T10:19:12Z
local.identifier.scopusID2-s2.0-79960229377
local.identifier.thomsonID000299427400001
dcterms.accessRightsOpen Access
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Brinkmann_Generation_of_Cubic_Grap_2011.pdf277.12 kBAdobe PDF


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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator