6-color theorem: Any planar graph \(K\), the vertices of \(K\) can be properly colored with at most 6 colors.