2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/95157We prove that it is NP-complete to determine whether there exists a distance-2 edge coloring (strong edge coloring) with 5 colors of a bipartite 2-inductive graph with girth 6 and maximum degree 3.3 pages, 1 figure in colorDiscrete MathematicsComputational Complexitytext