关键词: IC-平面图, 权转移方法, 权和, 弦4-圈

Abstract: The graph formed by removing an edge from a complete graph k₄ 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 v₁v₂v₃v₄v₁, 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