The strong chromatic index of $K_{t,t}$-free graphs

Richard Bi, Peter Bradshaw, Abhishek Dhawan +1

A strong edge coloring of a graph $G$ is an edge coloring $\varphi :E(G)\to \mathbb{N}$ such that each color class forms an induced matching in $G$. The strong chromatic index…