Four-color problem



[fawr-kuhl-er, fohr-] /ˈfɔrˈkʌl ər, ˈfoʊr-/

noun, Mathematics.
1.
the problem, solved in 1976, of proving the theorem that any geographic map can be colored using only four colors so that no connected countries with a common boundary are colored the same color.

Tagged:

Read Also:

  • Four-colour

    noun 1. (modifier) (of a print or photographic process) using the principle in which four colours (magenta, cyan, yellow, and black) are used in combination to produce almost any other colour

  • Four-colour glossies

    1. Literature created by marketroids that allegedly contains technical specs but which is in fact as superficial as possible without being totally content-free. “Forget the four-colour glossies, give me the tech ref manuals.” Often applied as an indication of superficiality even when the material is printed on ordinary paper in black and white. Four-colour-glossy manuals […]



  • Four colour map theorem

    mathematics, application (Or “four colour theorem”) The theorem stating that if the plane is divided into connected regions which are to be coloured so that no two adjacent regions have the same colour (as when colouring countries on a map of the world), it is never necessary to use more than four colours. The proof, […]

  • Four colour theorem

    four colour map theorem



Disclaimer: Four-color problem definition / meaning should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional. All content on this website is for informational purposes only.