G. F. Zhou, “A Note on Graphs of Class 1,” Discrete Mathematics, Vol. 263, No. 1-3, 2003, pp. 339-345. doi:10.1016/S0012-365X(02)00793-8
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.