Definitions from Wiktionary (four color theorem)
▸ noun: (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).
▸ Words similar to four color theorem
▸ Usage examples for four color theorem
▸ Idioms related to four color theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near four color theorem
▸ Rhymes of four color theorem
▸ Invented words related to four color theorem
▸ noun: (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).
Similar:
coloring,
cocoloring,
de Bruijn-Erdős theorem,
Ramsey's theorem,
Heawood conjecture,
Gomory's theorem,
chromatic number,
van der Waerden's theorem,
4-polytope,
Whitney's theorem,
more...
▸ Words similar to four color theorem
▸ Usage examples for four color theorem
▸ Idioms related to four color theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near four color theorem
▸ Rhymes of four color theorem
▸ Invented words related to four color theorem