Category:Tree decomposition
Jump to navigation
Jump to search
term in graph theory | |||||
| Upload media | |||||
| |||||
 | |||||
In graph theory, a branch-decomposition of an undirected graph G is a hierarchical clustering of the edges of G, represented by an unrooted binary tree T with the edges of G as its leaves
Media in category "Tree decomposition"
The following 7 files are in this category, out of 7 total.
-
Branch-decomposition.svg 596 × 346; 7 KB
-
Branchwidth 3-forbidden minors.svg 549 × 504; 6 KB
-
Inference.png 1,000 × 600; 33 KB
-
Partial 3-tree forbidden minors.svg 549 × 504; 7 KB
-
Pathwidth-1 obstructions.svg 288 × 144; 1 KB
-
Tree decomposition.svg 495 × 657; 8 KB
-
Treedecompsnocolour.JPG 1,035 × 547; 50 KB
