On the Nelson Unit Distance Coloring Problem

DOI10.2307/2589618zbMath0986.05041OpenAlexW4249255531MaRDI QIDQ2757416

Carsten Thomassen

Publication date: 26 November 2001

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

zbMATH Keywords

tilingHausdorff spacegraph on a surfaceunit distance coloring

Mathematics Subject Classification ID

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

Related Items (2)

Triangle colorings require at least seven colors ⋮ The Hadwiger–Nelson Problem

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