Category:Four Color Theorem

From ProofWiki
Jump to navigation Jump to search

Any planar graph $G$ can be assigned a proper vertex $k$-coloring such that $k \le 4$.