![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/5/5a/3x3_grid_graph_haven.svg/640px-3x3_grid_graph_haven.svg.png&w=640&q=50)
Bramble (graph theory)
Method of graph decomposition / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Bramble (graph theory)?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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.[1]
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/5/5a/3x3_grid_graph_haven.svg/220px-3x3_grid_graph_haven.svg.png)