Edge Colorings of Planar Graphs with Maximum Degree Five

Abstract

A finite simple graph is of class one if its edge chromatic number is equal to the maximum degree of this graph. It is proved here that every planar graph with the maximum degree $5$ and without $4$ or $5$-cycles is of class one. One of Zhou’s results is improved.