✦ LIBER ✦

Non-Separating Paths in 4-Connected Graphs

✍ Scribed by Ken-ichi Kawarabayashi; Orlando Lee; Xingxing Yu

Book ID: 105764685
Publisher: Springer
Year: 2005
Tongue: English
Weight: 193 KB
Volume: 9
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-005-0240-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-separating even cycles in highly con

Non-separating even cycles in highly connected graphs

✍ Shinya Fujita; Ken-ichi Kawarabayashi 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 255 KB

Maximum non-path-connected graphs

✍ George R.T Hendry 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 227 KB

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

Path-connectivity in graphs

✍ Michael Hager 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 420 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