Pages that link to "Item:Q4556187"

The following pages link to Computing Small Unit-Distance Graphs with Chromatic Number 5 (Q4556187):

Displaying 7 items.

• Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\) (Q2172834) (← links)
• The chromatic number of the plane is at least 5: a new proof (Q2189746) (← links)
• Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres (Q2675865) (← links)
• Avoiding Multiple Repetitions in Euclidean Spaces (Q5208643) (← links)
• Coloring distance graphs on the plane (Q6046170) (← links)
• Chromatic coloring of distance graphs, III (Q6113545) (← links)
• Chromatic coloring of distance graphs \(\mathrm{V}\) (Q6625099) (← links)