The decomposition of trees into subtrees

DOI10.1002/JGT.3190080404zbMATH Open0552.05027OpenAlexW2003010259MaRDI QIDQ3344008FDOQ3344008

Authors: Yair Caro 

Publication date: 1984

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190080404

Recommendations

• Decompositions of graphs into trees
• Tree decomposition
• Packing and decomposition of graphs with trees
• Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)
• Families of Trees Decompose the Random Graph in an Arbitrary Way

zbMATH Keywords

graph decompositionsubtrees

Mathematics Subject Classification ID

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

Cited In (9)

• Decomposing a relation into a tree of binary relations
• A Helly property of arcs
• Decomposition into two trees with orientation constraints
• Families of Trees Decompose the Random Graph in an Arbitrary Way
• Decomposition of large combinatorial structures
• Tree decomposition
• Unavoidable subtrees
• Packing \([1, \Delta ]\)-factors in graphs of small degree
• Combinatorial Image Analysis

This page was built for publication: The decomposition of trees into subtrees

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