Revisiting Semistrong Edge-Coloring of Graphs

Borut Lužar, Martina Mockovčiaková, Roman Soták

A matching $M$ in a graph $G$ is {\em semistrong} if every edge of $M$ has an endvertex of degree one in the subgraph induced by the vertices of $M$. A {\em semistrong edge-colorin…