Tree decomposition
From MaRDI portal
Recommendations
- Computing Tree Decompositions
- Tree decomposition of graphs
- Directed tree decompositions
- The decomposition of trees into subtrees
- Tree decomposition by eigenvectors
- Decompositions of graphs into trees
- Null decomposition of trees
- Tree decompositions for a class of graphs
- scientific article; zbMATH DE number 4053039
- Decomposition of complete graphs into arbitrary trees
Cites work
Cited in
(17)- Tree-decompositions of graphs. I
- A note on the tree decompositions of graphs
- Applications of matroid partition to tree decomposition
- Null decomposition of trees
- Decomposition into two trees with orientation constraints
- String decompositions of graphs
- Finding a smooth frame decomposition of a graph
- The decomposition of trees into subtrees
- Tree Decomposition with Function Filtering
- Decomposition of graphs into internally disjoint trees
- Tree decomposition of graphs
- scientific article; zbMATH DE number 719398 (Why is no real title available?)
- scientific article; zbMATH DE number 1533198 (Why is no real title available?)
- scientific article; zbMATH DE number 2147929 (Why is no real title available?)
- Some results on tree decomposition of graphs
- Lazy tree splitting
- Decomposing a relation into a tree of binary relations
This page was built for publication: Tree decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955927)