The Five Color Theorem is a result in mathematical graph theory that states that any planar graph can be colored with at most five colors such that no two adjacent vertices share the same color. This theorem is a weakening of the famous Four Color Theorem, which asserts that four colors are sufficient to color any planar graph.
New to topics? Read the docs here!