LIGHT 3-CYCLES IN 1-PLANAR GRAPHS WITH DEGREE RESTRICTIONS
Xin Zhang · Bulletin of the Korean Mathematical Society · 2014
In this paper, we prove that the 3-cycle is light in the family of 1-planar graphs with minimum vertex degree at least 5 and minimum edge degree at least 12. This generates a known result of Fabrici and Madaras [8].