Planar Graphs of Maximum Degree 6 and without Adjacent 8-Cycles Are 6-Edge-Colorable
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.
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2021-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/3562513 |