Pages that link to "Item:Q1569062"

The following pages link to Packing and decomposition of graphs with trees (Q1569062):

Displaying 23 items.

• Packing tree factors in random and pseudo-random graphs (Q405193) (← links)
• Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
• The tree number of a graph with a given girth (Q580352) (← links)
• On the shape of decomposable trees (Q1043555) (← links)
• Packing trees in complete graphs (Q1101132) (← links)
• A note on the tree decompositions of graphs (Q1387426) (← links)
• Minimum degree and minimum number of edge-disjoint trees (Q1420598) (← links)
• Clumsy packings of graphs (Q2001970) (← links)
• The spectrum of optimal excess graphs for trees with up to four edges (Q2176155) (← links)
• Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
• Optimal packings of bounded degree trees (Q2279501) (← links)
• Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\) (Q2857407) (← links)
• The decomposition of trees into subtrees (Q3344008) (← links)
• Packingk-edge trees in graphs of restricted vertex degrees (Q3594953) (← links)
• (Q3699703) (← links)
• Decompositions of graphs into trees (Q3835473) (← links)
• Tree decomposition of graphs (Q4240601) (← links)
• The decomposition threshold for bipartite graphs with minimum degree one (Q4803312) (← links)
• Packing trees of unbounded degrees in random graphs (Q4967960) (← links)
• Almost Every Tree With <i>m</i> Edges Decomposes <i>K</i>_{2<i>m</i>,2<i>m</i>} (Q5414145) (← links)
• Decomposing almost complete graphs by random trees (Q5890651) (← links)
• Decomposing almost complete graphs by random trees (Q5915750) (← links)
• Asymptotically optimal tree-packings in regular graphs (Q5950387) (← links)