MathLabs
Step 2 of 6: Triangulate every non-triangular face
In plain words

If a room's floor plan has a five-sided room, you can always snap a chalk line across it to split it into two triangular rooms without adding any new doors on the outside — you only add one interior wall (an edge) and gain one extra room (a face). Doing this to every non-triangular face never changes the running total V−E+FV-E+F, because the one new edge and one new face cancel each other out.

ΔV=0,ΔE=+1,ΔF=+1  ⟹  Δ(V−E+F)=0\Delta V = 0, \quad \Delta E = +1, \quad \Delta F = +1 \implies \Delta(V - E + F) = 0
The cube graph drawn as a planar embedding
The eight vertices and twelve edges of a cube drawn as a planar graph with no crossing edges, showing the square faces that a diagonal would split into two triangles.
Detailed analysis

If some face of the planar graph has four or more sides, draw a diagonal splitting it into two smaller faces. This adds exactly one new edge and one new face while leaving every vertex untouched, so it changes EE by +1+1 and FF by +1+1 and leaves V−E+FV - E + F exactly as it was. Repeating this for every non-triangular face — always possible for a polygon with at least four sides — turns the whole graph into a triangulation without ever changing V−E+FV - E + F.

Terms in this step
Triangulation
A way of splitting every face of a planar graph into triangles by drawing diagonals, without adding new vertices.
Knowledge used in this step