3 citations · 5 across the 2 of their papers we have counts for
4 papers
The chromatic number of the Minkowski plane -- the regular polygon case
Geoffrey Exoo, David Fisher, Dan Ismailescu
The Hadwiger-Nelson problem asks for the minimum number of colors, so that each point of the plane can be assigned a single color with the property that no two points unit-distance…
A -chromatic two-distance graph in the plane
Geoffrey Exoo, Dan Ismailescu
We prove that if one colors each point of the Euclidean plane with one of five colors, then there exist two points of the same color that are either distance or distance ap…
The Hadwiger-Nelson problem with two forbidden distances
Geoffrey Exoo, Dan Ismailescu
In 1950 Edward Nelson asked the following simple-sounding question: \emph{How many colors are needed to color the Euclidean plane such that no two points distance $1…
The chromatic number of the plane is at least 5 - a new proof
Geoffrey Exoo, Dan Ismailescu
We present an alternate proof of the fact that given any 4-coloring of the plane there exist two points unit distance apart which are identically colored.