How to Prove The Four Color Theorem
Jump to navigation
Jump to search
How To Prove The Four Color Theorem
I: Prove that if $G$ can be assigned a proper vertex $k$-coloring such that $k = 5$; then $G$ has an edge crossing.