1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
S. M. Dhannya, N. S. Narayanaswamy
Given a hypergraph H, the conflict-free colouring problem is to colour vertices of H using minimum colours so that each hyperedge in H sees a unique colour. We present a poly…