◀ ▲ ▶Branches / Graph-theory / 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 BY-SA 4.0!
![](https://github.com/bookofproofs/bookofproofs.github.io/blob/main/_sources/_assets/images/calendar-black.png?raw=true)
- Github:
-
![bookofproofs](https://github.com/bookofproofs.png?size=32)
References
Bibliography
- Aldous Joan M., Wilson Robin J.: "Graphs and Applications - An Introductory Approach", Springer, 2000