/fawr"kul"euhr, fohr"-/ , Math.
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.
Also called four-color theorem .
[ 1875-80 ]