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:
GT57 Planar Graphs - • Graph Theory: 57. Planar Graphs
GT58 Euler's Formula for Plane Graphs - • Graph Theory: 58. Euler's Formula for Plan...
For quick videos about Math tips and useful facts, check out my other channel
"Spoonful of Maths" - / spoonfulofmaths
Video Production by: Giuseppe Geracitano (goo.gl/O8TURb)