Pages that link to "Item:Q1405100"
From MaRDI portal
The following pages link to Edge-disjoint trees containing some given vertices in a graph (Q1405100):
Displaying 24 items.
- Packing Steiner trees (Q273179) (← links)
- Graphs with large generalized (edge-)connectivity (Q339485) (← links)
- Hamilton cycles in 5-connected line graphs (Q412285) (← links)
- Completely independent spanning trees in some regular graphs (Q516807) (← links)
- Packing Steiner trees on four terminals (Q602710) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Packing of Steiner trees and \(S\)-connectors in graphs (Q765198) (← links)
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279) (← links)
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs (Q958684) (← links)
- Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees (Q1693138) (← links)
- Steiner tree packing number and tree connectivity (Q1752665) (← links)
- The \(\kappa_k\)-connectivity of line graphs (Q2197398) (← links)
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs (Q2341720) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Packing Steiner trees with identical terminal sets (Q2390272) (← links)
- Packing strong subgraph in digraphs (Q2684051) (← links)
- Edge-disjoint Steiner trees and connectors in graphs (Q2701394) (← links)
- Packing the Steiner trees of a graph (Q3057108) (← links)
- Edge disjoint Steiner trees in graphs without large bridges (Q3652550) (← links)
- Generalized connectivity of some total graphs (Q4959532) (← links)
- (Q5002841) (← links)
- Steiner connectivity problems in hypergraphs (Q6072212) (← links)
- Directed Steiner tree packing and directed tree connectivity (Q6093140) (← links)
- On the Edge-Erdős–Pósa Property of Ladders (Q6489358) (← links)
