On the Nelson Unit Distance Coloring Problem

DOI10.2307/2589618MaRDI QIDQ2757416zbMATH OpenOpenAlexFDO

Authors Carsten Thomassen

Publication date 26 November 2001

Published in American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2589618

zbMATH Keywords

graph on a surfaceHausdorff spacetilingunit distance coloring

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Coloring distance graphs and graphs of diameters
• Unit-Distance Graphs in Minkowski metric spaces
• scientific article; zbMATH DE number 653246
• scientific article; zbMATH DE number 1552837
• Chromatic numbers of metric spaces

Cited in

(3)

• Triangle colorings require at least seven colors
• The Hadwiger-Nelson problem
• A lower bound on the number of colours needed to nicely colour a sphere

This page was built for publication: On the Nelson Unit Distance Coloring Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757416)