Wikipedia: “In graph-theoretic terminology, the four-color theorem states that the vertices of every planar graph can be colored with at most four colors so that no two adjacent vertices receive the same color, or for short, every planar graph is four-colorable.”
But exactly which kind of planar graphs have to be considered?:
- Without loops
- What about multiple edges? Why are these often excluded?