Mathematicians isolate graphs with extreme traits under simple names that stick for generations. The Balaban 10-cage realizes the (3,10)-cage with 70 vertices. Errera and Kittell graphs relate to the four color theorem. The Frucht graph is the smallest 3-regular with trivial automorphism group. Circuit designers draw on the Goldner-Harary and Wagner graphs for planar embeddings in printed circuit board layouts.