A strong edge-coloring φ of a graph G assigns colors to edges such that φ(e1)≠φ(e2) whenever e1 and e2 are at distance no more than 1. It is equivalent proper vertex coloring the square line G. In 1990 Faudree, Schelp, Gyárfás, Tuza conjectured if bipartite with maximum degree 3 sufficiently large girth, then has most 5 colors. 2021 this conjecture was disproved by Lužar, Mačajová, Škoviera, So...