Planar graphs

This page contains graphs and counts of various planar graph classes. All of
these graphs and numbers were obtained by the program plantri,
except the counts for connected planar graphs which were obtained by the program geng.

The graph lists available in 'planar_code' or 'graph6' format.
The larger files are compressed with gzip.

Some additional lists of planar graphs can be found on Brendan McKay's planar graph page.

Plantri can generate much more graph classes than the ones listed on this page
(e.g. planar graphs with a given minimum degree or with connectivity requirements).
For a complete list of the graph classes which can be generated with this program, see the plantri page.

Connected planar graphs

The table below lists the number of non-isomorphic connected planar graphs.
Note that isomorphism is considered according to the abstract graphs regardless of their embedding.
So graphs which can be embedded in multiple ways only appear once in the lists.
If you are looking for plane graphs which are not isomorphic as embedded graphs, we refer to the plantri-page.