Graph Theory: 59. Maximal Planar Graphs

In this video we define a maximal planar graph and prove that if a maximal planar graph has n vertices and m edges then m = 3n-6. We use this to show that any planar graph with n vertices has at most 3n-6 edges.
-- Bits of Graph Theory by Dr. Sarada Herke.

Related videos:

For quick videos about Math tips and useful facts, check out my other channel