Dataset of (3,6)-tight graphs

A graph G=(V,E) is (3,-6)-tight if |E|=3|V|-6 and for every subgraph G'=(V',E') with at least 3 vertices |E'|<=3|V'|-6.

The dataset provides all (3,6)-tight graphs with 3-11 vertices in graph6 data format as one zip file.