The graph colouring problem, a classic NP-hard challenge, is central to many practical applications such as scheduling, resource allocation and network management. Recent advances have seen the ...

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