Tree decompositions for a class of graphs
From MaRDI portal
Publication:1584355
Recommendations
Cited in
(18)- Decomposing hypergraphs into simple hypertrees
- Decomposition of complete graphs into arbitrary trees
- Consecutive colouring of oriented graphs
- Decompositions of critical trees with cutwidth k
- Decomposition of Cartesian products of regular graphs into isomorphic trees
- Tree decompositions of multigraphs
- Equations relating factors in decompositions into factors of some family of plane triangulations, and applications (With an appendix by Andrzej Schinzel)
- scientific article; zbMATH DE number 5917571 (Why is no real title available?)
- Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes
- scientific article; zbMATH DE number 4079474 (Why is no real title available?)
- On resolvable tree-decompositions of complete graphs
- scientific article; zbMATH DE number 1247777 (Why is no real title available?)
- scientific article; zbMATH DE number 1844471 (Why is no real title available?)
- scientific article; zbMATH DE number 861354 (Why is no real title available?)
- scientific article; zbMATH DE number 866654 (Why is no real title available?)
- Tree decomposition
- Generation of trees of a graph with the use of decomposition
- The tree structure of graphs for various graphical models
This page was built for publication: Tree decompositions for a class of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584355)