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.
Original language | Undefined |
---|---|
Pages (from-to) | 1289-1293 |
Journal | Mathematics of computation |
Volume | 65 |
Issue number | 215 |
Publication status | Published - 1996 |
Keywords
- METIS-118494
- IR-17975