Edge colorings of planar graphs without 5-cycles with two chords

A graph G is of class 1 if its edges can be colored with k colors in such a way that adjacent edges receive different colors, where k is the maximum degree of G. It is proved here that every planar graph is of class 1 if its maximum degree is at least 6 and any 5-cycle contains at most one chord.