Conflict-free colouring represents a rapidly evolving area of combinatorial optimisation with significant implications for both theoretical research and practical applications. In this framework, ...

A k-graph is an ordered couple (V, E) where V is a set and E a set of k-tuples of elements of V; thus, a 2-graph is an ordinary graph. If the notions of the independent set and the chromatic number ...

An illustration representing a hypergraph in which people within a large organization are connected by multi-way relationships. A hypergraph can model the complexity of these connections. Picture a ...