Four color theorem/Definition
Jump to navigation
Jump to search
(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.