𝔖 Bobbio Scriptorium
✦   LIBER   ✦

2-Change for k-connected networks

✍ Scribed by Michel X. Goemans; Kalyan T. Talluri

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
293 KB
Volume
10
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On minimally k-edge-connected graphs and
On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks
✍ Tibor JordΓ‘n πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 170 KB

A graph G = (V; E) is called minimally (k; T )-edge-connected with respect to some T βŠ† V if there exist k-edge-disjoint paths between every pair u; v ∈ T but this property fails by deleting any edge of G. We show that |V | can be bounded by a (linear) function of k and |T | if each vertex in V -T ha

The k-Critical 2k-Connected Graphs for k
The k-Critical 2k-Connected Graphs for k∈{3, 4}
✍ Matthias Kriesell πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 180 KB

A noncomplete graph G is called an (n, k)-graph if it is n-connected and G&X is not (n&|X | +1)-connected for any X V(G) with |X | k. Mader conjectured that for k 3 the graph K 2k+2 -(1-factor) is the unique (2k, k)-graph. We settle this conjecture for k 4.