Edge disjoint Steiner trees in graphs without large bridges

DOI10.1002/jgt.20389zbMath1183.05018OpenAlexW4245027221MaRDI QIDQ3652550

Matthias Kriesell

Publication date: 18 December 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20389

zbMATH Keywords

packingconnectivitySteiner treebridge

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Related Items (11)

Graphs with large generalized (edge-)connectivity ⋮ Packing Steiner trees on four terminals ⋮ Hamilton cycles in 5-connected line graphs ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ The \(\kappa_k\)-connectivity of line graphs ⋮ Edge-disjoint Steiner trees and connectors in graphs ⋮ Spanning trees: A survey ⋮ The generalized connectivity of the line graph and the total graph for the complete bipartite graph ⋮ Generalized connectivity of some total graphs ⋮ Packing of Steiner trees and \(S\)-connectors in graphs ⋮ 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
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• Zur Struktur minimal n-fach zusammenhängender Graphen
• Edge-disjoint trees containing some given vertices in a graph
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Eine Reduktionsmethode für den Kantenzusammenhang in Graphen
• A Reduction Method for Edge-Connectivity in Graphs

This page was built for publication: Edge disjoint Steiner trees in graphs without large bridges