Skip to search formSkip to main contentSkip to account menu

Five color theorem

Known as: Five colour theorem, Five-color map theorem 
The five color theorem is a result from graph theory that given a plane separated into regions, such as a political map of the counties of a state… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
With the help of Neutrosophy and Quad-stage Method, the proof for negation of “the four color theo-rem” is given. In which the… 
2012
2012
In this paper, we will define the necessary concepts to formulate map coloring problems. Then, we will prove Euler’s formula and… 
2009
2009
A formal proof has not been found for the four color theorem since 1852 when Francis Guthrie first conjectured the four color… 
2002
2002
Based on a representation of primitive proof objects as λ-terms, which has been built into the theorem prover Isabelle recently… 
1976
1976
1975
1975
Let f be a face of a plane graph G. The Three and Five Color Theorem proved here states that the vertices of G can be colored…