On the tree packing problem
From MaRDI portal
Recommendations
Cites work
- Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- On generalized matching problems
- On the Complexity of General Graph Factor Problems
- On the tree packing problem
- Packing subgraphs in a graph
- Packings by cliques and by finite families of graphs
- Packings by Complete Bipartite Graphs
- Parallel concepts in graph theory
- The Factorization of Linear Graphs
Cited in
(15)- Two packing problems on \(k\)-matroid trees
- On the tree packing problem
- Maximum tree-packing in time \(O(n^{5/2})\)
- Packing in trees
- Integral packing of trees and branchings
- Maximal buttonings of trees
- An approximate version of the tree packing conjecture
- The complexity of the node capacitated in-tree packing problem
- scientific article; zbMATH DE number 4132205 (Why is no real title available?)
- scientific article; zbMATH DE number 125473 (Why is no real title available?)
- On the minimal packing of a tree with fixed vertices
- Packing Spanning Trees
- Non-preemptive tree packing
- Maximum tree-packing in time O(n5/2)
- On cyclic packing of a tree
This page was built for publication: On the tree packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1183337)