Applications of matroid partition to tree decomposition (Q1568255)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1462510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Applications of matroid partition to tree decomposition |
scientific article; zbMATH DE number 1462510 |
Statements
Applications of matroid partition to tree decomposition (English)
0 references
29 November 2000
0 references
Edmonds' matroid partition theorem is applied to obtain alternative proofs of two tree decomposition theorems due to Shi Minyong. As an application, a necessary and sufficient condition for a connected graph to have a tree decomposition into two trees of order \(n-1\) is derived.
0 references
tree
0 references
matroid
0 references
partition
0 references
decomposition
0 references
0.7758690714836121
0 references
0.7686996459960938
0 references
0.7660443782806396
0 references
0.7650231719017029
0 references
