Tree decomposition of graphs

DOI10.1002/(SICI)1098-2418(199805)12:3%3C237::AID-RSA2%3E3.0.CO;2-WzbMATH Open0917.05059OpenAlexW2026218370MaRDI QIDQ4240601FDOQ4240601

Authors: Raphael Yuster 

Publication date: 29 April 1999

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199805)12:3%3C237::aid-rsa2%3E3.0.co;2-w

Recommendations

• Packing and decomposition of graphs with trees
• Tree decomposition
• Decompositions of graphs into trees
• Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)

zbMATH Keywords

treedecomposition

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (17)

• Decomposing Graphs of High Minimum Degree into 4‐Cycles
• Decomposing a relation into a tree of binary relations
• Decomposing graphs into a spanning tree, an even graph, and a star forest
• Decomposition of complete graphs into arbitrary trees
• Combinatorial and computational aspects of graph packing and graph decomposition
• Decomposition into two trees with orientation constraints
• Tree decompositions of multigraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Packing and decomposition of graphs with trees
• The tree structure of graphs for various graphical models
• Isolating nodes in recursive trees
• Tree decomposition
• Title not available (Why is that?)
• Null decomposition of trees
• Generation of trees of a graph with the use of decomposition
• Decomposing hypergraphs into simple hypertrees

This page was built for publication: Tree decomposition of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240601)