Colouring lattice points by real numbers
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 2 (2005), pp. 230-232
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
We establish a criterion for the existence of an $f$-colouring with a finite span of the $d$-dimensional lattice graph $\mathbb Z^d$.
[1] N. L. Biggs, Integer Programming Techniques for the Frequency Assignment Problem: Results and Prospects, CDAM Research Report Series LSE-CDAM-97-06, 1998, 4 pp.
[2] D. G. Fon-Der-Flaass, RTO Proceedings 13: Frequency assignment, Sharing and Conservation in Systems (Aerospace), Papers presented at the IST Symposium Aalborg, Denmark, 5–7 October 1998, 6-1–6-4