1 paper · 1 filter
Bubai Manna, Bodhayan Roy
For a graph G = (V,E) where each vertex is coloured by one of k colours, consider a subset C of V such that for each vertex v in V\C, its set of nearest neighbours in C contains at…