Let G be a simple connected planar graph with at least three vertices. Prove that if every face of G has degree 3, then G has an even number of faces
I've looked around and haven't found any questions similar to this.
I'm trying to prove this. I know that every face shares two edges so if I were to use Euler's formula 3f = 2m. Im not really sure where to go from there.