Journal of Jilin University Science Edition ›› 2020, Vol. 58 ›› Issue (5): 1093-1099.

Previous Articles     Next Articles

Weight of Light Chords 4-Cycles in IC-Planar Graphs with Degree Restrictions

TIAN Jingjing   

  1. School of Mathematics and Computer Science, Shaanxi University of Technology, Hanzhong 723000, Shaanxi Province, China
  • Received:2020-03-27 Online:2020-09-26 Published:2020-11-18

Abstract: The graph formed by removing an edge from a complete graph k4 was called chordal 4-cycle. By discharging method, the author discussed the weight of 4-cycle with chords in IC-planar graphs with degree restrictions. The author proved that each IC-planar graph with minimum vertex degree at least 5 and minimum edge degree at least 11 contained a light chordal 4-cycle v1v2v3v4v1, and proved that the upper bounds of weight of this kind of light chordal 4-cycle was at most 37.

Key words: IC-planar graph, discharging method, weight, chordal 4-cycle

CLC Number: 

  • O157.5