Packing Steiner trees on four terminals

DOI10.1016/j.jctb.2010.04.003zbMath1208.05012OpenAlexW2074699475MaRDI QIDQ602710

Matthias Kriesell

Publication date: 5 November 2010

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.2010.04.003

zbMATH Keywords

binary treeedge-connectivitybridgeSteiner tree packing

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Related Items (3)

The \(\kappa_k\)-connectivity of line graphs ⋮ Edge-disjoint Steiner trees and connectors in graphs ⋮ Steiner tree packing number and tree connectivity

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
• Hardness and approximation results for packing Steiner trees
• 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 Steiner trees on four terminals