Packing of Steiner trees and S-connectors in graphs

DOI10.1016/J.JCTB.2011.06.003MaRDI QIDQ765198zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

submodular functionSteiner treepartition lattice\(S\)-connectormatroid union theoremtree packing

Mathematics Subject Classification ID

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)

Recommendations

• Packing Steiner trees
• Edge-disjoint Steiner trees and connectors in graphs
• On packing connectors
• Steiner tree packing number and tree connectivity
• Packing the Steiner trees of a graph

Cites work

• scientific article; zbMATH DE number 3313442 (Why is no real title available?)
• 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
• Edge-Disjoint Spanning Trees of Finite Graphs
• 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
• On the degrees of the vertices of a directed graph

Cited in

(19)

• Spanning tree packing and 2-essential edge-connectivity
• Packing Steiner trees
• Approximate integer decompositions for undirected network design problems
• Packing strong subgraph in digraphs
• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• Packing the Steiner trees of a graph
• Steiner tree packing number and tree connectivity
• On the Edge-Erdős–Pósa Property of Ladders
• The \(\kappa_k\)-connectivity of line graphs
• Edge-disjoint Steiner trees and connectors in graphs
• 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 Steiner trees on four terminals
• Hamilton cycles in line graphs of 3-hypergraphs
• An algorithm for packing connectors
• Packings and Steiner systems in polar spaces
• Graphs with large generalized (edge-)connectivity
• Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
• Steiner connectivity problems in hypergraphs

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)