A058378 Number of trivalent 2-connected planar graphs with 2n nodes.

0, 1, 1, 3, 8, 29, 114, 583, 3310, 21168, 144622, 1039495, 7731540

Offset: 1

Author

N. J. A. Sloane, Dec 19 2000

Keywords

• nonn
• nice
• more
• hard
• changed

References

• 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.
• Computed by Brendan McKay and Gunnar Brinkmann using their program "plantri", Dec 19 2000.

Links

• Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph.
• Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]
• Gunnar Brinkmann and Brendan McKay, Guide to using plantri [Cached copy, with permission]
• M. Meringer, Tables of Regular Graphs

Crossrefs

Cf. A005964, A000109, A387146.