Regular graphs

graph in which every vertex is incident to exactly four edges

highly-symmetric node-link graph with 100 vertices and 36 edges per vertex

undirected cubic graph with 12 vertices and 18 edges

cubic graph with 8 vertices and 12 edges

cubic graph with 112 vertices and 168 edges

4-regular graph with 16 vertices and 32 edges

snark with 50 vertices and 75 edges

graph with a prism as its skeleton

graph with 96 vertices and 144 edges, the first known non-Hamiltonian cubic 3-connected bipartite graph

cubic graph with 126 vertices and 189 edges