1 citations · 1 across the 1 of their papers we have counts for
2 papers
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.DS2019
FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding
Akanksha Agrawal, Pradeesha Ashok, Meghana M Reddy +2
We present fixed parameter tractable algorithms for the conflict-free coloring problem on graphs. Given a graph , \emph{conflict-free coloring} of refers to coloring a…