Journal of East China Normal University(Natural Sc ›› 2010, Vol. 2010 ›› Issue (5): 20-26.

• Article • Previous Articles     Next Articles

Edge coloring of planar graphs for maximum degree six without adjacent k-cycles

NI Wei-ping   

  1. Department of Mathematics and Information Science, Zaozhuang University, Zaozhuang Shandong 277160, China
  • Received:2009-08-01 Revised:2009-12-01 Online:2010-09-25 Published:2010-09-25
  • Contact: NI Wei-ping

Abstract: By applying discharging method and using the properties of critical graphs, we proved that every simple planar graph G with Delta =6 is of class 1, if any two k-cycles of length at most 6 are not adjacent.

Key words: edge coloring, maximum degree, cycle, planar graph, edge coloring, maximum degree, cycle

CLC Number: