✦ LIBER ✦

Problem of path connections in graphs

✍ Scribed by D. Yu. Grigor'ev

Publisher: Springer US
Year: 1981
Tongue: English
Weight: 275 KB
Volume: 15
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf01404102

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path-connectivity in graphs

✍ Michael Hager 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 420 KB

Path connected graphs

✍ R. J. Faudree; R. H. Schelp 📂 Article 📅 1974 🏛 Akadmiai Kiad 🌐 English ⚖ 467 KB

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

Induced paths in 5-connected graphs

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 75 KB 👁 2 views

We show that between any two vertices of a 5-connected graph there exists an induced path whose vertices can be removed such that the remaining graph is 2-connected.

Paths in k-edge-connected graphs

✍ Haruko Okamura 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Paths and edge-connectivity in graphs

✍ Haruko Okamura 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 903 KB