On doubly light triangles in plane graphs

We prove that each 3-connected plane graph of minimum degree 5 contains a triangular face of the weight at most 17 such that the sum of sizes of three its adjacent faces is at most 13. This extends theorem of Borodin on light triangles in normal plane maps. In addition, we present several related results concerning configurations of faces around a triangle in various families of plane graphs.