Pages that link to "Item:Q2701394"
From MaRDI portal
The following pages link to Edge-disjoint Steiner trees and connectors in graphs (Q2701394):
Displaying 9 items.
- Packing Steiner trees (Q273179) (← links)
- Packing of Steiner trees and \(S\)-connectors in graphs (Q765198) (← links)
- On packing connectors (Q1272488) (← links)
- Constructing edge-disjoint Steiner paths in lexicographic product networks (Q1738072) (← links)
- The \(\kappa_k\)-connectivity of line graphs (Q2197398) (← links)
- \(k\)-tree connectivity of line graphs (Q2231726) (← links)
- Bounds on the maximum number of edge-disjoint Steiner trees of a graph (Q2716516) (← links)
- Edge disjoint Steiner trees in graphs without large bridges (Q3652550) (← links)
- The edge-disjoing steiner problem in graphs (Q4893707) (← links)