A connected planar graph with 10 vertices and 3 edges on each face is known as a triangulation. In general, a triangulation of a planar graph with n vertices will have 3n - 6 edges. Therefore, a triangulation of a planar graph with 10 vertices will have 3 * 10 - 6 = 24 edges.