Explore relationships

Graph minor

In graph theory, an undirected graphH is called a minor of the undirected 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 include neither the complete graphK5 nor the complete bipartite graphK3,3.

Use + to expand a branch. Click a topic name to open its summary.