On the Universality and Extremality of graphs with a distance constrained colouring

Kaushik Majumder, Ushnish Sarkar

A lambda colouring (or $L(2,1)-$colouring) of a graph is an assignment of non-negative integers (with minimum assignment $0$) to its vertices such that the adjacent vertices must r…