A005964 Number of trivalent connected (or cubic) planar graphs with 2n nodes.
0, 1, 1, 3, 9, 32, 133, 681, 3893, 24809, 169206, 1214462, 9034509, 69093299, 539991437
Offset: 1
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.
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
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]
- F. C. Bussemaker, S. Cobeljic, L. M. Cvetkovic and J. J. Seidel, Computer investigations of cubic graphs, T.H.-Report 76-WSK-01, Technological University Eindhoven, Dept. Mathematics, 1976.
- Jan Goedgebeur and Patric R. J. Ostergard, Switching 3-Edge-Colorings of Cubic Graphs, arXiv:2105:01363 [math.CO], May 2021. See Table 3.
- M. Meringer, Tables of Regular Graphs.
- Eric Weisstein's World of Mathematics, Connected Graph.
- Eric Weisstein's World of Mathematics, Cubic Graph.
Extensions
Extended by Brendan McKay and Gunnar Brinkmann using their program "plantri", Dec 19 2000