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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1984-2015
01219842015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
  • Fu Yuhua
  • 2015
With the help of Neutrosophy and Quad-stage Method, the proof for negation of “the four color theorem” is given. In which the key… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
In this paper, we will define the necessary concepts to formulate map coloring problems. Then, we will prove Euler’s formula and… (More)
Is this relevant?
2010
2010
Let / 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… (More)
Is this relevant?
2009
2009
A formal proof has not been found for the four color theorem since 1852 when Francis Guthrie first conjectured the four color… (More)
  • figure 2
Is this relevant?
2009
2009
We generalize the Five Color Theorem by showing that it extends to graphs with two crossings. Furthermore, we show that if a… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In this paper, we introduce graph theory, and discuss the Four Color Theorem. Then we prove several theorems, including Euler’s… (More)
  • figure 2-1
  • figure 2-2
  • figure 2-3
  • figure 2-4
  • figure 3-1
Is this relevant?
2000
2000
 
Is this relevant?
1998
1998
848 NOTICES OF THE AMS VOLUME 45, NUMBER 7 E very planar map of connected countries can be colored using four colors in such a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1984
1984
We prove that if a graph embeds on a surface with all edges suitably short, then the vertices of the graph can be five-colored… (More)
  • figure 1
  • figure 2
Is this relevant?