𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On path connected graphs

✍ Scribed by Mordechai Lewin

Book ID
107884073
Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
702 KB
Volume
25
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Path connected graphs
Path connected graphs
✍ R. J. Faudree; R. H. Schelp πŸ“‚ Article πŸ“… 1974 πŸ› Akadmiai Kiad 🌐 English βš– 467 KB
Maximum non-path-connected graphs
Maximum non-path-connected graphs
✍ George R.T Hendry πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 227 KB
Path-connectivity in graphs
Path-connectivity in graphs
✍ Michael Hager πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 420 KB
Locating median paths on connected outer
Locating median paths on connected outerplanar graphs
✍ Isabella Lari; Federica Ricca; Andrea Scozzari; Ronald I. Becker πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 215 KB πŸ‘ 1 views
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