Planar Graphs of Maximum Degree 6 and without Adjacent 8-Cycles Are 6-Edge-Colorable

Abstract

In this paper, by applying the discharging method, we show that if G is a planar graph with a maximum degree of Δ=6 that does not contain any adjacent 8-cycles, then G is of class 1.