Keywords

#graph_minor

Graph minor

Subgraph with contracted edges

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, vertices and by contracting edges.

Thu 18th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Graph minor Robertson–Seymour theorem Planar graph Graph property Forbidden graph characterization Glossary of graph theory Hadwiger conjecture (graph theory) Petersen graph Graph theory Snark (graph theory)
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.