Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs

Abstract

We investigate the relationship between two kinds of vertex colorings of hypergraphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ordered, and in every hyperedge of the hypergraph the maximum color in the hyperedge occurs in only one vertex of the hyperedge. In a conflict-free coloring, in every… (More)
DOI: 10.1007/978-3-642-27660-6_16

Topics

3 Figures and Tables

Slides referencing similar topics