Edge Colorings of Planar Graphs without Adjacent Special Cycles

Abstract

By applying discharging methods and properties of critical graphs, we proved that every simple planar graph $G$ with $\mathrm{\Delta }(G)\ge 5$ is of class 1, if any 4-cycle is not adjacent to a 5-cycle in $G$.