A planar graph is a graph that can be drawn in the plane without any edge crossings. Such a drawing (with no edge crossings) is called a plane graph. A given plane graph divides the plane into regions and each region has a boundary that outlines it. We look at some examples and also give an informal proof of the fact that the complete bipartite graph with partite sets of size 3 and 3 is not planar.
-- Bits of Graph Theory by Dr. Sarada Herke.
Related videos:
• Graph Theory: 04. Fami... - Graph Theory: 04. Families of Graphs
• Do Maths with Pigeons ... - Do Maths with Pigeons and Handshakes
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)
28 мар 2015
