Branches History Index

◀ ▲ ▶Branches / Graph-theory / Theorem: Five Color Theorem for Planar Graphs

Theorem: Five 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 5.$$

Table of Contents

Proofs: 1

Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs

References

Bibliography

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