Computing Small Unit-Distance Graphs with Chromatic Number 5

zbMath1404.05054arXiv1805.12181MaRDI QIDQ4556187

Marijn J. H. Heule

Publication date: 23 November 2018

Full work available at URL: https://arxiv.org/abs/1805.12181

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Ramsey theory (05D10)

Related Items (6)

Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\) ⋮ Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres ⋮ Coloring distance graphs on the plane ⋮ The chromatic number of the plane is at least 5: a new proof ⋮ Chromatic coloring of distance graphs, III ⋮ Avoiding Multiple Repetitions in Euclidean Spaces

This page was built for publication: Computing Small Unit-Distance Graphs with Chromatic Number 5