four color theorem
Jump to navigation
Jump to search
English[edit]
Proper noun[edit]
- (graph theory) A theorem stating that given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions so that no two adjacent regions have the same color (adjacent being defined as two regions sharing a boundary, not counting corners, in which three or more regions share a boundary).
Further reading[edit]
- Four color theorem on Wikipedia.Wikipedia