The decomposition of trees into subtrees

DOI10.1002/JGT.3190080404MaRDI QIDQ3344008zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graph decompositionsubtrees

Mathematics Subject Classification ID

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

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

Cited in

(9)

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

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)