Preprint
Sep 2026
Strong Edge Colouring of Disk Graphs: A 6-Approximation and an Improved Unit-Disk Bound
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 $\chi'_s(G)$. If each edge $e$ is assigned a list $L'(e)$ and its colour must belong to $L'(e)$, the corresponding parameter is the strong list chro...
Sandip Das, Sk Samim Islam, A. Mohapatra et al.
· 0 citations