Google Can Haz Four Color Theorem July 14, 2009 2 Comments
Google’s favicon has bothered me for a little while now – not because it looks bad, but because it uses five colors.
In graph theory, it is not very difficult to prove that any planar graph is five colorable. One proof of the theorem relies on the fact that if a graph is a K5 it [...]