Article citationsMore>>

Y. H. Bu and W. F. Wang, “Some Sufficient Conditions for a Planar Graph of Maximum Degree Six to Be Class 1,” Discrete Mathematics, Vol. 306, No. 13, 2006, pp. 1440-1445. doi:10.1016/j.disc.2006.03.032

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.