OFFSET
6,4
COMMENTS
The smallest 3-connected graph is the complete graph on 4 vertices which has 6 edges.
LINKS
Hugo Pfoertner, 3-connected graphs for n<=18 edges, list in PARI-readable format.
R. W. Robinson, Tables of 2-Connected and 3-Connected Graphs by Nodes and Edges, Table VI, pages 19-27.
PROG
(PARI) \\ It is assumed that the 3cc.gp file (from the linked zip archive) has been read before, i.e., \r [path]3cc.gp
for(k=1, #ThreeConnectedData, print1(#ThreeConnectedData[k], ", "));
\\ printing of the graphs for n <= 9
print(ThreeConnectedData[6..9]) \\ Hugo Pfoertner, Dec 11 2020
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Andrew Howroyd, Oct 31 2020
EXTENSIONS
a(17)-a(25) from Hugo Pfoertner using data from Robinson's tables, Nov 20 2020
a(26)-a(28) from Andrew Howroyd using data from Robinson's tables, Nov 24 2020
STATUS
approved