Packing of Steiner trees and \(S\)-connectors in graphs
From MaRDI portal
Publication:765198
DOI10.1016/j.jctb.2011.06.003zbMath1237.05170OpenAlexW2127250537MaRDI QIDQ765198
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
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40)
Related Items (13)
Packing Steiner trees ⋮ Hamilton cycles in line graphs of 3-hypergraphs ⋮ Graphs with large generalized (edge-)connectivity ⋮ Packing Steiner trees on four terminals ⋮ Steiner connectivity problems in hypergraphs ⋮ Directed Steiner tree packing and directed tree connectivity ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ Packing strong subgraph in digraphs ⋮ The \(\kappa_k\)-connectivity of line graphs ⋮ Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs ⋮ Edge-disjoint Steiner trees and connectors in graphs ⋮ Steiner tree packing number and tree connectivity ⋮ Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
Cites Work
- Unnamed Item
- 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 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
- Edge disjoint Steiner trees in graphs without large bridges
- A Reduction Method for Edge-Connectivity in Graphs
This page was built for publication: Packing of Steiner trees and \(S\)-connectors in graphs
