D. P. Sanders and Y. Zhao, “Planar Graphs of Maximum Degree Seven Are Class 1,” Journal of Combinatorial Theory, Series B, Vol. 83, No. 2, 2001, pp. 202-212. doi:10.1006/jctb.2001.2047

has been cited by the following article:

• TITLE: Edge Colorings of Planar Graphs without 6-Cycles with Two Chords

  AUTHORS: Ling Xue, Jianliang Wu

  KEYWORDS: Edge Coloring; Planar Graph; Cycle; Class 1

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.3 No.2, April 25, 2013

  ABSTRACT: It is proved here that if a planar graph has maximum degree at least 6 and any 6-cycle contains at most one chord, then it is of class 1.