Four-Color Theorem

Definition

Four-Color Theorem

Every planar graph can be coloured by four colours so that no pair of neighbouring vertices receive the same color.