Generation of trees of a graph with the use of decomposition
From MaRDI portal
Recommendations
- Decompositions of graphs into trees
- Tree decomposition of graphs
- Decomposition of complete graphs into arbitrary trees
- Tree decompositions for a class of graphs
- scientific article; zbMATH DE number 866654
- Tree-decompositions of graphs. I
- Decomposition of some planar graphs into trees
- Some results on tree decomposition of graphs
- scientific article; zbMATH DE number 4053039
- Decomposing graphs into paths and trees
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3508526 (Why is no real title available?)
- A V log V algorithm for isomorphism of triconnected planar graphs
- An Analysis of the Wang Algebra of Networks
- Dividing a Graph into Triconnected Components
- Parallel concepts in graph theory
- Topological analysis and synthesis of linear systems
Cited in
(5)- Propagation tree decompositions and linearly independent vertices
- Applications of lattice theory to graph decomposition
- Finding a smooth frame decomposition of a graph
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- scientific article; zbMATH DE number 3993606 (Why is no real title available?)
This page was built for publication: Generation of trees of a graph with the use of decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800368)
