Encyclopedia of Graphs

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 all polyhedral graphs on up to 11 vertices.

OEIS: A000944

Only signed in users can post comments. Sign in here
Don't have an account yet? Register here