𝔖 Bobbio Scriptorium
✦   LIBER   ✦

High Connectivity Keeping Sets Inn-Connected Graphs

✍ Scribed by W. Mader

Book ID
106167515
Publisher
Springer-Verlag
Year
2004
Tongue
English
Weight
301 KB
Volume
24
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Connectivity keeping paths in k-connecte
Connectivity keeping paths in k-connected graphs
✍ W. Mader πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 109 KB πŸ‘ 1 views

## Abstract A result of G. Chartrand, A. Kaugars, and D. R. Lick [Proc Amer Math Soc 32 (1972), 63–68] says that every finite, k‐connected graph __G__ of minimum degree at least ⌊3__k__/2βŒ‹ contains a vertex __x__ such that __G__βˆ’__x__ is still __k__‐connected. We generalize this result by proving t

Connectivity keeping trees in k-connecte
Connectivity keeping trees in k-connected graphs
✍ W. Mader πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 86 KB

We show that one can choose the minimum degree of a k-connected graph G large enough (independent of the vertex number of G) such that G contains a copy T of a prescribed tree with the property that G -V (T ) remains k-connected.