1 problem

0 votes0 replies1 view
Wegner's conjectural bound for L(2,1)-labellings of planar graphs
An $L(2,1)$ -labelling of a graph $G$ assigns nonnegative integer labels to its vertices so that adjacent vertices receive labels differing by at least $2$ , while vertices at distan…
Conjectureopendistance-constrained-labeling graph-labeling planar-graphsarXiv posted 3 days ago

Wegner's conjectural bound for L(2,1)-labellings of planar graphs