Four-colour problem.
The paper is devoted to the four-color problem, its history, and its proof. This problem from graph theory addresses the question of whether four colors are sufficient to color any political map in such a way that no two neighboring states share the same color. Neighboring states are defined as those that share a common boundary line -- that is, they do not merely touch at a single point.\N\NThe author traces the history of the problem from its first mention by Augustus De Morgan in 1852, through various unsuccessful attempts to prove it, to the solution presented in 1976 by American mathematicians Kenneth Appel and Wolfgang Haken.\N\NFor the entire collection see [Zbl 0989.00024].
This page was built for publication: Four-colour problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884815)
