Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Bramble_(graph_theory)> ?p ?o. }
Showing items 1 to 16 of
16
with 100 items per page.
- Bramble_(graph_theory) abstract "In graph theory, a bramble for an undirected graph G is a family of connected subgraphs of G that all touch each other: for every pair of disjoint subgraphs, there must exist an edge in G that has one endpoint in each subgraph. The order of a bramble is the smallest size of a hitting set, a set of vertices of G that has a nonempty intersection with each of the subgraphs. Brambles may be used to characterize the treewidth of G.".
- Bramble_(graph_theory) thumbnail 3x3_grid_graph_haven.svg?width=300.
- Bramble_(graph_theory) wikiPageID "36601188".
- Bramble_(graph_theory) wikiPageRevisionID "539322220".
- Bramble_(graph_theory) hasPhotoCollection Bramble_(graph_theory).
- Bramble_(graph_theory) subject Category:Graph_minor_theory.
- Bramble_(graph_theory) subject Category:Graph_theory_objects.
- Bramble_(graph_theory) comment "In graph theory, a bramble for an undirected graph G is a family of connected subgraphs of G that all touch each other: for every pair of disjoint subgraphs, there must exist an edge in G that has one endpoint in each subgraph. The order of a bramble is the smallest size of a hitting set, a set of vertices of G that has a nonempty intersection with each of the subgraphs. Brambles may be used to characterize the treewidth of G.".
- Bramble_(graph_theory) label "Bramble (graph theory)".
- Bramble_(graph_theory) label "Ежевика (теория графов)".
- Bramble_(graph_theory) sameAs m.0knwhq_.
- Bramble_(graph_theory) sameAs Q4956109.
- Bramble_(graph_theory) sameAs Q4956109.
- Bramble_(graph_theory) wasDerivedFrom Bramble_(graph_theory)?oldid=539322220.
- Bramble_(graph_theory) depiction 3x3_grid_graph_haven.svg.
- Bramble_(graph_theory) isPrimaryTopicOf Bramble_(graph_theory).