We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
Let H = (V, E) be a hypergraph. A conflict-free coloring of H is an assignment of colors to V such that in each hyperedge e E there is at least one uniquely-colored vertex. This ...
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...