By _QWOiNYUIVMPFSBKLiGSMAP_, history, 2 years ago, In English,

Hello everyone i was solving a problem which wants the number of faces in a planar graph of N nodes E edges. it is solvable by euler formula but what is the proof of this formula this link has alot of helpful proofs but i could understand the 3rd proof if anyone intersting in understanding it please explain it to me.

thanks in advance :)

  • Vote: I like it
  • -9
  • Vote: I do not like it