A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof.