Graph Theory 5: Polyhedra, Planar Graphs, & F-E+V=2

preview_player
Показать описание
Euler's Theorem for Polyhedra and Planar Graphs establishing a relationship between the number of faces, edges, and vertices. Includes a proof by mathematical induction on the number of vertices.
Рекомендации по теме
Комментарии
Автор

This is by far the best lecture I have seen in my life about graph theory. Thank you!

quiop
Автор

The induction should be done on the number of edges instead of vertices because G and G' can also be differed by 2 edges, 1 vertex and 1 face and do not necessarily look like the given example.

bradleyli
Автор

Thanks a lot for the info!
Awesome teaching!

MasiKarimi
Автор

best explained from an amazing teacher, thank you !

derfabdallah