polyhedral graph
3-connected simple planar graph parametrized by the number of nodes
Herschel graph
bipartite undirected graph
prism graph
graph with a prism as its skeleton
maximal planar graph
planar graph, where no edge can be added
Golomb graph
undirected unit-distance graph requiring four colors
truncated icosahedral graph
graph with 60 vertices and 90 edges
Platonic graph
graph with a Platonic solid as its skeleton
Kittell graph
maximal planar graph on 23 nodes
Archimedean graph
graph that forms the skeleton of one of the Archimedean solids
truncated tetrahedral graph
graph with 12 vertices and 18 edges
nested triangles graph
planar graph formed by connecting multiple triangle graphs