cubic graph
graph in which every vertex is incident to exactly three edges
prism graph
graph with a prism as its skeleton
Gray graph
undirected bipartite graph with 54 vertices and 81 edges
snark
connected, bridgeless cubic graph with chromatic index equal to 4
Ljubljana graph
undirected bipartite graph with 112 vertices and 168 edges
Desargues graph
highly symmetric graph with 20 vertices and 30 edges
Coxeter graph
cubic distance-regular graph with 28 vertices and 42 edges
dodecahedral graph
polyhedral graph of the dodecahedron, with 20 vertices and 30 edges
tetrahedral graph
complete graph on 4 vertices
Franklin graph
graph often embedded on the Klein bottle
Foster graph
bipartite 3-regular graph with 90 vertices and 135 edges
Pappus graph
graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus configuration
Wagner graph
cubic graph with 8 vertices and 12 edges
cubical graph
graph with 8 vertices and 12 edges
truncated icosahedral graph
graph with 60 vertices and 90 edges
Nauru graph
node-link graph with 24 vertices, one of seven symmetric generalized Petersen graphs
Petersen graph
cubic graph with 10 vertices and 15 edges
McGee graph
graph with 24 vertices and 36 edges
Dyck graph
node-link graph, the only cubic symmetric graph on 32 vertices
generalized Petersen graph
type of mathematical graph
zero-symmetric graph
connected graph in which each vertex has exactly three incident edges and, for each two vertices, there is a unique symmetry taking one vertex to the other
Laves graph
periodic spatial graph
Harries graph
3-regular undirected graph with 70 vertices and 105 edges
truncated tetrahedral graph
graph with 12 vertices and 18 edges