|
%I #7 Jan 17 2020 03:30:25
%S 1,1,6,12,85,471,5373,75145,1543382,41554738
%N Number of 3-connected bipartite graphs on n unlabeled nodes.
%e a(6) = 1 because the complete bipartite graph K_{3,3} is the only 3-connected bipartite graph on 6 vertices.
%Y Cf. A005142.
%K nonn,more
%O 6,3
%A _Gordon F. Royle_, May 10 2007
|
