P395: Enumeration of all minimal triangle graphs with a fixed number vertices

P395: Enumeration of all minimal triangle graphs with a fixed number vertices

Input:

An integer $n$.

Output:

All minimal triangle graphs with $n$ vertices.

Complexity:

Comment:

Reference:

[Bowen1967b] (Bibtex)