• four color theorem

four color theorem (suomeksi)

Määritelmät:

• (lb, en, graph theory) A theorem stating that given any separation of a plane into contiguous regions, producing a figure called a (m, en, map), no more than four colors are required to color the regions so that no two adjacent regions have the same color ((m, en, adjacent) being defined as two regions sharing a boundary, not counting corners, in which three or more regions share a boundary).