Light Edges in 3-Connected 2-Planar Graphs With Prescribed Minimum Degree

• DOI: 10.1007/s40840-016-0389-0
• Publication Date: 2016-06-24T15:08:34Z
• Authors: Zai Ping Lu; Ning Song
• Keywords: 0102 computer and information sciences; 01 natural sciences

A graph is called 2-planar if it can be drawn in the plane such that each edge is crossed by at most other two edges. The weight of an edge is the sum of degrees of its ends. In the present paper, we focus on 3-connected 2-planar graphs with minimum degree 6 and show the existence of edges with weight at most 30 by a discharging process.