Generation of Cubic Graphs
Loading...
Date
Authors
Brinkmann, Gunnar
Goedgebeur, Jan
McKay, Brendan
Journal Title
Journal ISSN
Volume Title
Publisher
DMTCS
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.
Description
Citation
Collections
Source
Discrete Mathematics and Theoretical Computer Science (DMTCS)
Type
Book Title
Entity type
Access Statement
Open Access
License Rights
DOI
Restricted until
Downloads
File
Description