Packing Steiner trees
From MaRDI portal
Publication:273179
DOI10.1016/j.jctb.2016.02.002zbMath1334.05116arXiv1307.7621OpenAlexW1899569194MaRDI QIDQ273179
Matt DeVos, Irene Pivotto, Jessica McDonald
Publication date: 21 April 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.7621
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Hamilton cycles in line graphs of 3-hypergraphs ⋮ Directed Steiner tree packing and directed tree connectivity ⋮ Packing strong subgraph in digraphs ⋮ The \(\kappa_k\)-connectivity of line graphs ⋮ Edge-disjoint Steiner trees and connectors in graphs ⋮ Steiner tree packing number and tree connectivity ⋮ The 2-Steiner distance matrix of a tree
Cites Work
- Unnamed Item
- Unnamed Item
- Packing of Steiner trees and \(S\)-connectors in graphs
- An approximate max-Steiner-tree-packing min-Steiner-cut theorem
- Edge-disjoint trees containing some given vertices in a graph
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Degree Bounded Matroids and Submodular Flows
- A Reduction Method for Edge-Connectivity in Graphs
- A THEOREM ON INDEPENDENCE RELATIONS
