bn:02879343n
Noun Concept
Categories: Graph theory objects, Graph minor theory
EN
graph minor  minor graph  Graph-minor  minor  minor-closed graph family
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
HAS KIND
STUDIED BY
Wikipedia
Wikidata
Wikidata Alias