Fill in the Form Below
Read the QnA guidelines
Read the QnA guidelines, Maximum characters: 500 - You have 500 characters left.
A simple,planar graph to which no edge can be added without destroying its planarity is called m maximal planar graph. Prove that every face in a maximal planar graph is a triangle.
* Views expressed by users on Q&A section are their own. Minglebox does not endorse the same
| For Advertisers
| We are Hiring
| Contact Us
copyright © 2012 minglebox communications pvt ltd. all rights reserved.