The number of polyhedral (3-Connected Planar) Graphs
Authors:
A. J. W. Duijvestijn.
Affiliation:
Department of Informatics, Technological University Twente, Enschede, The Netherlands
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.