◀ ▲ ▶Branches / Graphtheory / Theorem: Four Color Theorem for Planar Graphs
Theorem: Four Color Theorem for Planar Graphs
Let $G$ be a simple, connected, planar graph. Then the chromatic number of $G$ obeys the following inequality $$\chi(G)\le 4.$$
Table of Contents
Proofs: 1
Mentioned in:
Theorems: 1
Thank you to the contributors under CC BYSA 4.0!
 Github:

References
Bibliography
 Aldous Joan M., Wilson Robin J.: "Graphs and Applications  An Introductory Approach", Springer, 2000