bn:00214708n
Noun Concept
Categories: Articles with short description, Theorems in graph theory, Planar graphs, Computer-assisted proofs, Graph coloring
EN
four color theorem  Four-color map theorem  Four-Colour Map Problem  4-color conjecture  4-color problem
EN
In mathematics, the four color theorem, or the four color map theorem, states that no more than four colors are required to color the regions of any map so that no two adjacent regions have the same color. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, the four color theorem, or the four color map theorem, states that no more than four colors are required to color the regions of any map so that no two adjacent regions have the same color. Wikipedia
Statement in mathematics Wikidata
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). Wiktionary