Strong chromatic index of planar graphs with large girth
Gerard J. Chang, Mickaël Montassier, Arnaud Pêcher, André Raspaud · Discussiones Mathematicae Graph Theory · 2014
Let 4 be an integer. In this note, we prove that every planar graph with maximum degree and girth at least 10 + 46 is strong (2 -1)-edgecolorable, that is best possible (in terms of number of colors) as soon as G contains two adjacent vertices of degree . This improves [6] when 6.