planar graph
graph that can be embedded in the plane
Herschel graph
bipartite undirected graph
octahedral graph
polyhedral graph of the octahedron, with 6 vertices and 12 edges
series-parallel graph
recursively-formed graph with two terminal vertices
maximal planar graph
planar graph, where no edge can be added
Soifer Graph
planar graph with 9 vertices and 20 edges
triangle graph
complete graph on 3 vertices
relative neighborhood graph
undirected graph used in computational geometry
Fritsch graph
planar graph with 9 vertices and 21 edges
Golomb graph
undirected unit-distance graph requiring four colors
dodecahedral graph
polyhedral graph of the dodecahedron, with 20 vertices and 30 edges
singleton graph
graph consisting of only one vertex and no edges
tetrahedral graph
complete graph on 4 vertices
Gabriel graph
graph defined from a set of points in the Euclidean plane
Hall Graph
10-regular graph with 65 vertices and 325 edges
Poussin graph
graph with 15 vertices and 39 edges
cubical graph
graph with 8 vertices and 12 edges
truncated icosahedral graph
graph with 60 vertices and 90 edges
Moser spindle
undirected unit-distance graph requiring four colors
self-dual graph
planar graph that is isomorphic to its dual graph
Walther graph
planar graph with 25 vertices and 31 edges
shortest-path graph
undirected graph defined from a set of points in the Euclidean plane
Delaunay triangulation
triangulation method named after Boris Delaunay
Urquhart graph
graph obtained by removing the longest edge from each triangle in the Delaunay triangulation
Suzuki graph
strongly regular graph with 1782 vertices and 370656 edges
second Royle graph
planar, Hamiltonian, and Eulerian graph with 8 vertices and 18 edges
matchstick graph
planar unit distance graph
icosahedral graph
polyhedral graph of the icosahedron, with 12 vertices and 30 edges
truncated tetrahedral graph
graph with 12 vertices and 18 edges