A proper hypergraph colouring assigns colours to the vertices of a hypergraph so that no hypergraph edge is monochromatic. Each colour class is a hypergraph independent set. This is often called weak colouring, to distinguish it from requiring every pair of vertices in each edge to have different colours.
Articles by others on the same topic
There are currently no matching articles.