Strong Edge Colouring of Disk Graphs: A 6-Approximation and an Improved Unit-Disk Bound

Sandip Das, Sk Samim Islam, Aashirwad Mohapatra +2

A strong edge colouring of a graph $G$ is an edge colouring in which every colour class is an induced matching. The minimum number of colours is the strong chromatic index $χ'_s(G)…