Packing of Steiner trees and S-connectors in graphs
DOI10.1016/J.JCTB.2011.06.003zbMATH Open1237.05170OpenAlexW2127250537MaRDI QIDQ765198FDOQ765198
Authors: Douglas B. West, Hehui Wu 
Publication date: 19 March 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2011.06.003
Recommendations
Trees (05C05) Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)
Cites Work
- On the degrees of the vertices of a directed graph
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Title not available (Why is that?)
- Edge-disjoint trees containing some given vertices in a graph
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- A Reduction Method for Edge-Connectivity in Graphs
- An approximate max-Steiner-tree-packing min-Steiner-cut theorem
- Edge disjoint Steiner trees in graphs without large bridges
Cited In (18)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- Directed Steiner tree packing and directed tree connectivity
- Steiner tree packing number and tree connectivity
- Packing Steiner trees
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
- Packings and Steiner systems in polar spaces
- Packing the Steiner trees of a graph
- Edge-disjoint Steiner trees and connectors in graphs
- Packing Steiner trees on four terminals
- Steiner connectivity problems in hypergraphs
- Approximate integer decompositions for undirected network design problems
- Graphs with large generalized (edge-)connectivity
- On the Edge-Erdős–Pósa Property of Ladders
- Hamilton cycles in line graphs of 3-hypergraphs
- Packing strong subgraph in digraphs
- An algorithm for packing connectors
- The \(\kappa_k\)-connectivity of line graphs
This page was built for publication: Packing of Steiner trees and \(S\)-connectors in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765198)
