W. P. Ni, “Edge Colorings of Planar Graphs with Δ = 6 without Short Cycles Contain Chords,” Journal of Nanjing Normal University, Vol. 34, No. 3, 2011, pp. 19-24 (in Chinese).

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.