scientific article; zbMATH DE number 1146232
From MaRDI portal
Publication:4386304
zbMath0974.05047MaRDI QIDQ4386304
No author found.
Publication date: 4 December 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
On Element-Connectivity Preserving Graph Simplification ⋮ Graphs with large generalized (edge-)connectivity ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ The \(\kappa_k\)-connectivity of line graphs ⋮ Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs ⋮ Towards tight(er) bounds for the excluded grid theorem ⋮ Steiner tree packing number and tree connectivity ⋮ Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs ⋮ The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs
This page was built for publication:
