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: | Wenwen Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2021-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/3562513 |
Similar Items
-
List Edge Colorings of Planar Graphs without Adjacent 7-Cycles
by: Wenwen Zhang
Published: (2021-01-01) -
List Edge Coloring of Planar Graphs without 6-Cycles with Two Chords
by: Hu Linna, et al.
Published: (2021-02-01) -
The List Edge Coloring and List Total Coloring of Planar Graphs with Maximum Degree at Least 7
by: Sun Lin, et al.
Published: (2020-11-01) -
A Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable
by: Enqiang Zhu, et al.
Published: (2020-01-01) -
Planar graphs without {4,6,8}-cycles are 3-choosable
by: Yueying Zhao, et al.
Published: (2021-07-01)