Edge-disjoint Steiner trees and connectors in graphs
From MaRDI portal
Publication:2701394
DOI10.1007/s00373-023-02621-3OpenAlexW4321087641MaRDI QIDQ2701394
Huayue Liu, Hengzhe Li, Yaping Mao, Jian-Bing Liu
Publication date: 28 April 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02621-3
Cites Work
- Unnamed Item
- Packing Steiner trees
- Packing Steiner trees on four terminals
- Packing of Steiner trees and \(S\)-connectors in graphs
- An approximate max-Steiner-tree-packing min-Steiner-cut theorem
- Edge-connectivity and edge-disjoint spanning trees
- Edge-disjoint trees containing some given vertices in a graph
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- Steiner tree packing number and tree connectivity
- Connectivity and edge-disjoint spanning trees
- Bounds of the number of disjoint spanning trees
- Packing the Steiner trees of a 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: Edge-disjoint Steiner trees and connectors in graphs