A note on the edge colorings of planar graphs without 7-cycles with three chords

作者：Zhang, Wenwen; Wu, Jian-Liang^*

来源：Ars Combinatoria, 2018, 138: 393-402.

• Edge coloring
• Planar graph
• Cycle
• Class 1

A graph is said to be of class 1 if its edge chromatic number is equal to the maximum degree of this graph. It is proved here that every planar graph is of class 1 if its maximum degree is at least 6 and every 7-cycle contains at most two chords.

• 出版日期2018-4
• 单位山东大学