A new algorithm efficiently solves the graph isomorphism problem, which has puzzled computer scientists for decades.

But that doesn't mean five is the absolute minimum. Mathematicians know that it's possible that a graph will come along requiring six colors of paint, or even seven.

Graph Coloring: The process of assigning colours to vertices or edges of a graph so that adjacent elements have distinct colours, commonly used in scheduling and resource allocation problems.