The number of polyhedral (3-connected planar) graphs
1996
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.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
18
References
17
Citations
NaN
KQI