Graph minor

If you find our videos helpful you can support us by buying something from amazon.

Graph minor

In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges and vertices and by contracting edges.The theory of graph minors began with Wagner's theorem that a graph is planar if and only if its minors do not include the complete graph K5 nor the complete bipartite graph K3,3.

=======Image-Copyright-Info=======
=======Image-Copyright-Info========

-Video is targeted to blind users

Attribution:
Article text available under CC-BY-SA
image source in video