Precise upper bound for the strong edge chromatic number of sparse planar graphs

Abstract

We prove that every planar graph with maximum degree Δ is strong edge (2Δ - 1)-colorable if its girth is at least 40[Δ/2] + 1. The bound 2Δ - 1 is reached at any graph that has two adjacent vertices of degree Δ.