Packing and decomposition of graphs with trees

DOI10.1006/JCTB.1999.1934zbMATH Open1028.05095OpenAlexW1994941667MaRDI QIDQ1569062FDOQ1569062

Authors Raphael Yuster

Publication date 25 June 2000

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/1010d8b7b6ae8ab30af1efba289c9588f47f1a28

Mathematics Subject Classification ID

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

Recommendations

• Tree decomposition of graphs
• Decompositions of graphs into trees
• Optimal factorizations of families of trees
• Packingk-edge trees in graphs of restricted vertex degrees
• Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3503285 (Why is no real title available?)
• A bound for Wilson's theorem (III)
• Covering graphs: The covering problem solved
• Packing graphs: The packing problem solved
• Some remarks on packing trees
• Tree decomposition of graphs

Cited in

(23)

• Optimal packings of bounded degree trees
• Packingk-edge trees in graphs of restricted vertex degrees
• scientific article; zbMATH DE number 4127221 (Why is no real title available?)
• Packing tree factors in random and pseudo-random graphs
• Clumsy packings of graphs
• The tree number of a graph with a given girth
• Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)
• The spectrum of optimal excess graphs for trees with up to four edges
• Decomposing almost complete graphs by random trees
• Decomposition of graphs into trees with bounded maximum degree
• Almost every tree with \(m\) edges decomposes \(K_{2m,2m}\)
• Decompositions of graphs into trees
• Decomposing almost complete graphs by random trees
• Packing trees of unbounded degrees in random graphs
• The decomposition of trees into subtrees
• scientific article; zbMATH DE number 3924795 (Why is no real title available?)
• Minimum degree and minimum number of edge-disjoint trees
• Asymptotically optimal tree-packings in regular graphs
• Packing trees in complete graphs
• Combinatorial and computational aspects of graph packing and graph decomposition
• The decomposition threshold for bipartite graphs with minimum degree one
• Packing branchings under cardinality constraints on their root sets
• On the shape of decomposable trees

This page was built for publication: Packing and decomposition of graphs with trees

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