𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Private Computation: k-Connected versus 1-Connected Networks

✍ Scribed by Markus Bläser; Andreas Jakoby; Maciej Liskiewicz; Bodo Manthey

Publisher
Springer
Year
2005
Tongue
English
Weight
255 KB
Volume
19
Category
Article
ISSN
0933-2790

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

2-Change for k-connected networks
2-Change for k-connected networks
✍ Michel X. Goemans; Kalyan T. Talluri 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 293 KB
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

Connected [k, k + 1]-factors of graphs
Connected [k, k + 1]-factors of graphs
✍ Mao-cheng Cai 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Let k be an odd integer /> 3, and G be a connected graph of odd order n with n/>4k -3, and minimum degree at least k. In this paper it is proved that if for each pair of nonadjacent vertices u, v in G max{dG(u), d~(v)} >~n/2, then G has an almost k--factor F + and a matching M such that F-and M are

Connected, locally 2-connected, K1,3-fre
Connected, locally 2-connected, K1,3-free graphs are panconnected
✍ S. V. Kanetkar; P. R. Rao 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 1 views

## Abstract A graph __G__ is locally __n__‐connected, __n__ ≥ 1, if the subgraph induced by the neighborhood of each vertex is __n__‐connected. We prove that every connected, locally 2‐connected graph containing no induced subgraph isomorphic to __K__~1,3~ is panconnected.