An 18-colouring of 3-space omitting distance one

DOI10.1016/S0012-365X(96)00309-3zbMath0879.05030MaRDI QIDQ1363671

D. Coulson

Publication date: 12 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

latticechromatic numberVoronoi regionunit distancecoloration

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Erd?s problems and related topics of discrete geometry (52C10) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Cites Work

• Bounds on the measurable chromatic number of \({\mathbb{R}}\)
• Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
• Distances realized by sets covering the plane
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An 18-colouring of 3-space omitting distance one