|
%I #10 Oct 06 2023 03:25:32
%S 1,0,1,0,7,6,87,305,3730,39140
%N Number of 3-connected unlabeled graphs on n nodes with girth at least 6.
%e The smallest graph in the class is the Heawood graph with 14 vertices.
%Y Cf. A366224 (3-connected graphs of girth at least 5).
%K nonn,hard
%O 14,5
%A _Brendan McKay_, Oct 05 2023
|
