An 18-colouring of 3-space omitting distance one
From MaRDI portal
(Redirected from Publication:1363671)
Recommendations
- A 15-colouring of 3-space omitting distance one
- The surface of a sufficiently large sphere has chromatic number at most 7
- On the chromatic number of plane tilings
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- On the space chromatic number
- scientific article; zbMATH DE number 653246
- scientific article; zbMATH DE number 2042228
- On the Chromatic Numbers of and with Intervals of Forbidden Distances
- The chromatic number of the plane: the bounded case
- The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
Cites work
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 865987 (Why is no real title available?)
- scientific article; zbMATH DE number 3098608 (Why is no real title available?)
- Bounds on the measurable chromatic number of \({\mathbb{R}}\)
- Distances realized by sets covering the plane
- Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
Cited in
(6)- Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions
- Coloring of the \(d^{\text{th}}\) power of the face-centered cubic grid
- Bounds on the measurable chromatic number of \({\mathbb{R}}\)
- A 15-colouring of 3-space omitting distance one
- scientific article; zbMATH DE number 2042228 (Why is no real title available?)
- Coloring the Voronoi tessellation of lattices
This page was built for publication: An 18-colouring of 3-space omitting distance one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363671)
