𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximating k -node Connected Subgraphs via Critical Graphs

✍ Scribed by Kortsarz, Guy; Nutov, Zeev

Book ID
118180440
Publisher
Society for Industrial and Applied Mathematics
Year
2005
Tongue
English
Weight
183 KB
Volume
35
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Contractible subgraphs in k-connected gr
Contractible subgraphs in k-connected graphs
✍ Zemin Jin; Xingxing Yu; Xiaoyan Zhang πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 185 KB

## Abstract For a graph __G__ we define a graph __T__(__G__) whose vertices are the triangles in __G__ and two vertices of __T__(__G__) are adjacent if their corresponding triangles in __G__ share an edge. Kawarabayashi showed that if __G__ is a __k__‐connected graph and __T__(__G__) contains no ed

Critically (k, k)-connected graphs
Critically (k, k)-connected graphs
✍ Kiyoshi Ando; Yoko Usami πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 359 KB
Onk- critical 2k- connected graphs
Onk- critical 2k- connected graphs
✍ Jianji Su; Xudong Yuan; Qiaofeng Zhao πŸ“‚ Article πŸ“… 2003 πŸ› SP Science China Press 🌐 English βš– 224 KB
On k-critical, n-connected graphs
On k-critical, n-connected graphs
✍ Stephen Maurer; Peter J. Slater πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 718 KB

A graph G which iit n-connected (but not (I! I)-connected) is defined ro be k-xitical if for every S 6; V(G), where f S i d k. the connectivity of G -I S is h -/S ia We will say that G is an (n\*,k\*) graph if G is n-conneckxt (b:lt nat (n t Itconnected) and k-crirical (hut not (k c l)criticaf). Thi