Skip to search formSkip to main contentSkip to account menu

Hadwiger–Nelson problem

Known as: Chromatic number of the plane, Hadwiger-Nelson, The chromatic number of space 
In geometric graph theory, the Hadwiger–Nelson problem, named after Hugo Hadwiger and Edward Nelson, asks for the minimum number of colors required… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In 1950 Edward Nelson asked the following simple-sounding question: \emph{How many colors are needed to color the Euclidean… 
2016
2016
  • A. Soifer
  • 2016
  • Corpus ID: 123269053
Inspired by the Four-Color Conjecture, the Hadwiger–Nelson Problem became one of the famous open problems of mathematics in its… 
2016
2016
2015
2015
We compute the Hadwiger-Nelson numbers $\chi(E^2)$ for certain number fields $E$, that is, the smallest number of colors required… 
2009
2009
The Hadwiger-Nelson problem asks for the chromatic number of the plane, i.e., the minimum number of colors needed to color the… 
2009
2009
This study builds on work by Matveev & Nelson (2004) which investigated the relationship between cross-cultural communication… 
2008
2008
  • C. Kruskal
  • 2008
  • Corpus ID: 44339344
Review
2005
Review
2005
Although it has been argued that students with behavioral disorders benefit most from placement in general education classrooms… 
1994
1994
Recovery of Function after Serial Lesions of Prefrontal Cortex in the Rhesus Monkey: A Retrospective D.G. Stein. Comparative…