Category:Four Color Theorem
Jump to navigation
Jump to search
Any planar graph $G$ can be assigned a proper vertex $k$-coloring such that $k \le 4$.
Subcategories
This category has only the following subcategory.
Pages in category "Four Color Theorem"
The following 10 pages are in this category, out of 10 total.