The number of polyhedral (3-connected planar) graphs

Duijvestijn, A.

doi:10.1090/S0025-5718-96-00749-1

The number of polyhedral (3-connected planar) graphs
HTML articles powered by AMS MathViewer

by A. J. W. Duijvestijn PDF

Math. Comp. 65 (1996), 1289-1293 Request permission

Abstract:

Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex polyhedra, with up to 26 edges. Results have been checked with the the number of rooted c-nets of R.C. Mullin and P.J. Schellenberg and Liu Yanpei.

References

Leonard Eugene Dickson, New First Course in the Theory of Equations, John Wiley & Sons, Inc., New York, 1939. MR 0000002
A.J.W. Duijvestijn, Simple perfect squared squares and $2\times 1$ squared rectangles of order 26, Mathematics of Computation,65(1996)to appear.
Adrianus Johannes Wilhelmus Duijvestijn, Electronic computation of squared rectangles, Technische Hogeschool Eindhoven, Eindhoven, 1962. Thesis; Technische Wetenschap aan de Technische Hogeschool te Eindhoven. MR 0144492
—, Electronic computation of squared rectangles, Philips Research Reports 17 (1962), 523–612.
—, Algorithmic calculation of the order of the automorphism group of a graph, Memorandum 221, Twente University of Technology, The Netherlands, 1978.
A. J. W. Duijvestijn, Simple perfect squared squares and $2\times 1$ squared rectangles of orders $21$ and $24$, J. Combin. Theory Ser. B 59 (1993), no. 1, 26–34. MR 1234380, DOI 10.1006/jctb.1993.1051
A. J. W. Duijvestijn, Simple perfect squared squares and $2\times 1$ squared rectangles of order $25$, Math. Comp. 62 (1994), no. 205, 325–332. MR 1208220, DOI 10.1090/S0025-5718-1994-1208220-9
A.J.W. Duijvestijn and P.J. Federico, The number of polyhedral (3-connected planar ) graphs, Mathematics of Computation 37 (1981), 523–532.
Yan Pei Liu, On the number of rooted $c$-nets, J. Combin. Theory Ser. B 36 (1984), no. 1, 118–123. MR 742391, DOI 10.1016/0095-8956(84)90018-2
Dillencourt M.B., 1991, private communication.
R. C. Mullin and P. J. Schellenberg, The enumeration of $c$-nets via quadrangulations, J. Combinatorial Theory 4 (1968), 259–276. MR 218275, DOI 10.1016/S0021-9800(68)80007-9
W. T. Tutte, A theory of $3$-connected graphs, Nederl. Akad. Wetensch. Proc. Ser. A 64 = Indag. Math. 23 (1961), 441–455. MR 0140094, DOI 10.1016/S1385-7258(61)50045-5
W. T. Tutte, A census of planar maps, Canadian J. Math. 15 (1963), 249–271. MR 146823, DOI 10.4153/CJM-1963-029-x