Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Generation of Cubic Graphs

Thumbnail Image

Date

2011

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

Keywords

Keywords: Canonical construction path; Cubic graph; Generation; Graph; Algorithms Canonical construction path; Cubic graph; Generation; Graph

Citation

URI

http://hdl.handle.net/1885/59131

Collections

ANU Research Publications

Source

Discrete Mathematics and Theoretical Computer Science (DMTCS)

Type

Journal article

Book Title

Entity type

Access Statement

Open Access

License Rights

DOI

Restricted until

Downloads

File
Description
01_Brinkmann_Generation_of_Cubic_Grap_2011.pdf (277.12 KB)

DSpace software copyright © 2002-2026 LYRASIS