Skip to search formSkip to main contentSkip to account menu

Four color theorem

Known as: Four colour map problem, Four color map theorem, Four Colour Theorem 
In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A basic task of computer-aided design of discrete devices consists in the implementation of logic operations with Boolean… 
2010
2010
In this paper, we give a proof for four color theorem(four color conjecture). Our proof does not involve computer assistance and… 
2010
2010
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these… 
2008
2008
In human reasoning and multi-modal information processing, the diagrams offer a visual clarity in examining spatial constraints… 
2001
2001
Some connections between quantum computing and quantum algebra are described, and the Four Color Theorem (4CT) is interpreted… 
2000
2000
Healthcare in Canada is delivered through thirteen provincial and territorial systems of publicly funded health care, informally… 
Review
1995
Review
1995
The four-color theorem, that every loopless planar graph is 4-colorable, was proved in 1977 by Appel and Haken, but there remain… 
1994
1994
There exist exactly 4044 topological types of 4-colorable tile-4-transitive tilings of the plane. These can be obtained by…