1 citations · 2 across the 2 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2023★ 1 cited
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 refers to colouring of vertices of a graph such that any two distinct vertices which are at distance at most two receive different colour…
cs.CC2022★ 1 cited
Polynomial Kernels for Generalized Domination Problems
Pradeesha Ashok, Rajath Rao, Avi Tomar
In this paper, we study the parameterized complexity of a generalized domination problem called the [] Dominating Set problem. This problem generalizes a large number of prob…