×

zbMATH — the first resource for mathematics

Generation of cubic graphs. (English) Zbl 1283.05256
Summary: We describe a new algorithm for the efficient generation of all non-isomorphic connected cubic graphs. A program based on 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.

MSC:
05C85 Graph algorithms (graph-theoretic aspects)
05C40 Connectivity
05C38 Paths and cycles
PDF BibTeX XML Cite
Full Text: Link arXiv