Planar Graphs of Maximum Degree Six without 7-cycles are Class One

Danjun Huang, Weifan Wang

Abstract


In this paper, we prove that every planar graph of maximum degree six without 7-cycles is class one.

Keywords


Planar graph; edge coloring; class one; cycle

Full Text: PDF