The following pages link to (Q4309118):
Displaying 11 items.
- Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm (Q596065) (← links)
- All unit-distance graphs of order 6197 are 6-colorable (Q1272487) (← links)
- An 18-colouring of 3-space omitting distance one (Q1363671) (← links)
- Packing an equilateral polygon in a thin strip (Q1900002) (← links)
- Distance graphs with large chromatic number and without cliques of given size in the rational space (Q2282833) (← links)
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) (Q2313626) (← links)
- On the chromatic number of subsets of the Euclidean plane (Q2441349) (← links)
- On computational complexity of length embeddability of graphs (Q2629266) (← links)
- Proof of a conjecture on fractional Ramsey numbers (Q3553231) (← links)
- On the chromatic number of an infinitesimal plane layer (Q4580441) (← links)
- On the chromatic numbers of small-dimensional Euclidean spaces (Q5891225) (← links)
