Hypergraph Coloring
Hypergraph colouring is defined as follows. Let be a hypergraph such that . Then is a proper colouring of if and only if, for all there exists such that .
In other words: For every edge in the graph having at least two nodes as endpoints, the nodes this edge connects are not all of the same color.
Read more about this topic: Hypergraph