Four color theorem/Definition
Jump to navigation
Jump to search
![](http://s9.addthis.com/button1-share.gif)
(A famous mathematical statement with a long history) For every planar graph, four colors suffice to color its vertices in such a way that adjacent vertices have different colors.