k-edge-connected graph
graph that remains connected whenever fewer than k edges are removed
Gray graph
undirected bipartite graph with 54 vertices and 81 edges
Franklin graph
graph often embedded on the Klein bottle
Robertson graph
4-regular graph with 19 vertices and 38 edges
Nauru graph
node-link graph with 24 vertices, one of seven symmetric generalized Petersen graphs
Meredith graph
4-regular undirected graph with 70 vertices and 140 edges
butterfly graph
graph with 5 nodes and 6 edges
Hoffman graph
4-regular graph with 16 vertices and 32 edges