Page "Four color theorem" Paragraph 13
from
Wikipedia
The set of regions of a map can be represented more abstractly as an undirected graph that has a vertex for each region and an edge for every pair of regions that share a boundary segment.
This graph is planar ( it is important to note that we are talking about the graphs that have some limitations according to the map they are transformed from only ): it can be drawn in the plane without crossings by placing each vertex at an arbitrarily chosen location within the region to which it corresponds, and by drawing the edges as curves that lead without crossing within each region from the vertex location to each shared boundary point of the region.
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 " (; ).
Page 1 of 1.
1.923 seconds.