Geometric intersection graphs form an intriguing class of structures in which vertices represent geometric objects – such as line segments, discs, or curves – and an edge is established between two ...

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

Before reading this guide, you may find it helpful to read the guide on graphs from Module 7 (M7) and the guide on indices from Module 8 (M8). In Module 7 (M7) Graphs, you learned that simultaneous ...