This is a thread about a recent cursèd result in graph theory that I enjoy.

It's about graph coloring. For background, a coloring of a graph is an assignment of colors to the nodes, so that every edge is multicolored. A neat fact ("Brooks' Theorem") says that every r-regular connected graph can be colored using r colors, with the only exceptions being cliques and odd cycles. We will talk about such graphs. For example, all nodes above graph have deg 3, and we colored it using only 3 colors.