The following pages link to (Q4386304):
Displaying 12 items.
- Graphs with large generalized (edge-)connectivity (Q339485) (← 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)
- Steiner tree packing number and tree connectivity (Q1752665) (← links)
- The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants (Q2007586) (← links)
- The \(\kappa_k\)-connectivity of line graphs (Q2197398) (← links)
- Towards tight(er) bounds for the excluded grid theorem (Q2221926) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- Some operations on Menger graphs (Q2715095) (← links)
- On Element-Connectivity Preserving Graph Simplification (Q3452796) (← links)
- A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs (Q5878427) (← links)
- The parameterized complexity of the survivable network design problem (Q6655676) (← links)
