Planar graph

Revision en1, by _QWOiNYUIVMPFSBKLiGSMAP_, 2018-01-03 13:11:54

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 :)


  Rev. Lang. By When Δ Comment
en1 English _QWOiNYUIVMPFSBKLiGSMAP_ 2018-01-03 13:11:54 432 Initial revision (published)