Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
Daniel Král͏̌, Petr Škoda · SIAM Journal on Discrete Mathematics · 2008
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we consider a problem of Griggs to determine the optimum spans of $L(p,q)$-labellings of the infinite triangular plane lattice and find (using a computer) the optimum spans for all p and q.