3.Next

In graph theory, an undirected graph is called a minor of the undirected graph if can be formed from 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 include neither

3.Next