Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs

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 in every hyperedge e of H, there is a vertex whose colour is different from that of all other vertices in e. Our results are on a variant of the conflict-free colouring problem considered by Cheilaris et al.[Cheilaris et al., 2014], known as the 1-Strong Conflict-Free (1-SCF) colouring problem, for which they presented a polynomial time...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.