Clique number of the square of a line graph

Małgorzata Śleszyńska-Nowak

An \emph{edge coloring} of a graph $G$ is strong if each color class is an induced matching of $G$. The \emph{strong chromatic index} of $G$, denoted by ${\chi }_s^{\prime }(G)$, is th…