Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice

We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infinite triangular plane lattice (solving an open problem of Griggs). Key words. real number graph labelling, channel assignment problem, graph labelling with distance conditions AMS subject classifications. 05C15

• Type: Journal
• Year: 2008
• Where: SIAMDM
• Authors: Daniel Král, Petr Skoda
• Keywords: Graph Labelling Problem, Labelling, Real Number Graph, SIAMDM 2008