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

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}\)

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Packing graphs: The packing problem solved
• Some remarks on packing trees
• Title not available (Why is that?)
• Tree decomposition of graphs
• Covering graphs: The covering problem solved
• A bound for Wilson's theorem (III)

Cited In (21)

• Packing trees of unbounded degrees in random graphs
• Packing branchings under cardinality constraints on their root sets
• Combinatorial and computational aspects of graph packing and graph decomposition
• Packingk-edge trees in graphs of restricted vertex degrees
• Clumsy packings of graphs
• Packing tree factors in random and pseudo-random graphs
• Almost Every Tree With m Edges Decomposes K_2m,2m
• The decomposition of trees into subtrees
• Minimum degree and minimum number of edge-disjoint trees
• Decomposing almost complete graphs by random trees
• Packing trees in complete graphs
• The tree number of a graph with a given girth
• The decomposition threshold for bipartite graphs with minimum degree one
• Decompositions of graphs into trees
• Title not available (Why is that?)
• Asymptotically optimal tree-packings in regular graphs
• Optimal packings of bounded degree trees
• On the shape of decomposable trees
• Decomposing almost complete graphs by random trees
• Title not available (Why is that?)
• Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)

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)