\((d,1)\)-total labelling of planar graphs with large girth and high maximum degree (Q2370454)

The \((d,1)\)-total number \(\lambda^T_d(G)\) of graph \(G\) is the width of a smallest range of integers that suffices to label the vertices and the edges of \(G\) such that no two adjacent vertices have the same label, no two incident edges have the same label, and the difference betweeen the labels of a vertex and its incident edges is at least \(d\). In this paper, the inequality \(\lambda^T_d(G)\leq \Delta+2d-2\) for planar graphs \(G\) with large girth and high maximum degree \(\Delta\) is proved. The results are optimal for \(d=2\).