A Breakthrough in the Problem of Graph Coloring

How to color a graph without two adjacent edges having the same color? Researchers have just developed an algorithm that achieves it in a time almost as fast as the theoretical maximum.