Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,347,421 papers from all fields of science
Search
Sign In
Create Free Account
Four color theorem
Known as:
Four colour map problem
, Four color map theorem
, Four Colour Theorem
Expand
In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
1-planar graph
Albertson conjecture
Algebraic graph theory
Apex graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A note on two conjectures that strengthen the four colour theorem
Xuding Zhu
2017
Corpus ID: 119143677
There are two conjectures concerning planar graph colourings that are strengthenings of the four colour theorem. One concerns…
Expand
2015
2015
Graphs with Eulerian unit spheres
O. Knill
arXiv.org
2015
Corpus ID: 18823235
d-spheres in graph theory are inductively defined as graphs for which all unit spheres S(x) are (d-1)-spheres and that the…
Expand
2010
2010
To Prove Four Color Theorem
W. Yue
,
W. Cao
2010
Corpus ID: 119323198
In this paper, we give a proof for four color theorem(four color conjecture). Our proof does not involve computer assistance and…
Expand
2009
2009
Markovian Network Interdiction and the Four Color Theorem
A. Gutfraind
,
Kiyan Ahmadizadeh
arXiv.org
2009
Corpus ID: 15314413
The Unreactive Markovian Evader Interdiction Problem (UME) asks to optimally place sensors on a network to detect Markovian…
Expand
2009
2009
A formal proof of the four color theorem
Limin Xiang
arXiv.org
2009
Corpus ID: 14789238
A formal proof has not been found for the four color theorem since 1852 when Francis Guthrie first conjectured the four color…
Expand
2008
2008
CHROMATIC AND TUTTE POLYNOMIALS FOR GRAPHS , ROOTED GRAPHS AND TREES
Gary Gordon
2008
Corpus ID: 14656275
The chromatic polynomial of a graph is a one-variable polynomial that counts the number of ways the vertices of a graph can be…
Expand
2003
2003
An Approach to a Proof of the Four-colour Problem
Xu Zhi
2003
Corpus ID: 124471789
Based on my recent writings about the colouring of a planar graph, this paper first analyzes the causes for the mistakes of A…
Expand
Review
2002
Review
2002
Strategies for multigraph edge coloring
Jeffrey M. Gilbert
2002
Corpus ID: 34531877
n mathematical graph theory, coloring problems are ubiquitous. Dating back to the famous four-color map problem, both the theory…
Expand
2001
2001
Quantum interpretations of the four color theorem
P. C. Kainen
2001
Corpus ID: 12477578
Some connections between quantum computing and quantum algebra are described, and the Four Color Theorem (4CT) is interpreted…
Expand
Review
1995
Review
1995
Progress on the Four-Color Theorem
P. Seymour
1995
Corpus ID: 126262320
The four-color theorem, that every loopless planar graph is 4-colorable, was proved in 1977 by Appel and Haken, but there remain…
Expand