1 citations · 1 across the 3 of their papers we have counts for
1 paper · 2 filters
S. M. Dhannya, N. S. Narayanaswamy
The k-Strong Conflict-Free (k-SCF, in short) colouring problem seeks to find a colouring of the vertices of a hypergraph H using minimum number of colours so that in every hy…