|
%I #22 Apr 01 2020 16:41:02
%S 0,1,1,3,8,29,114,583,3310,21168,144622,1039495,7731540
%N Number of trivalent 2-connected planar graphs with 2n nodes.
%D A. T. Balaban, Enumeration of Cyclic Graphs, pp. 63-105 of A. T. Balaban, ed., Chemical Applications of Graph Theory, Ac. Press, 1976; see p. 92.
%D Computed by _Brendan McKay_ and _Gunnar Brinkmann_ using their program "plantri", Dec 19 2000.
%H Gunnar Brinkmann and Brendan McKay, <a href="http://users.cecs.anu.edu.au/~bdm/plantri/">plantri and fullgen</a> programs for generation of certain types of planar graph.
%H Gunnar Brinkmann and Brendan McKay, <a href="/A000103/a000103_1.pdf">plantri and fullgen</a> programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]
%H Gunnar Brinkmann and Brendan McKay, <a href="/A007021/a007021.txt">Guide to using plantri</a> [Cached copy, with permission]
%H M. Meringer, <a href="http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html">Tables of Regular Graphs</a>
%Y Cf. A005964, A000109.
%K nonn,nice,more,hard
%O 1,4
%A _N. J. A. Sloane_, Dec 19 2000
|
