P426: Enumeration of all cubic graphs with less than or equal to $n$ vertices

P426: Enumeration of all cubic graphs with less than or equal to $n$ vertices

Input:

An integer $n$.

Output:

All cubic graphs with less than or equal to $n$ vertices.

Complexity:

Comment:

Reference:

[Brinkmann2011] (Bibtex)