Search graph database
Polyhedral graphs are 3-connected simple planar graphs. A planar graph is a graph that can be embedded in the plane, i.e. it can be drawn on the plane in such a way that its edges intersect only at their endpoints. The following collection was calculated by the House of Graphs (source) and lists...