Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring

V P Abidha, Pradeesha Ashok, Avi Tomar +1

The \emph{Square Colouring} of a graph $G$ refers to colouring of vertices of a graph such that any two distinct vertices which are at distance at most two receive different colour…