✦ LIBER ✦

Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph

✍ Scribed by Yoshimi Egawa

Book ID: 107884259
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 348 KB
Volume: 42
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(87)90053-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycles through k+2 vertices in k-connect

Cycles through k+2 vertices in k-connected graphs

✍ N. Tsikopoulos 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 73 KB

Nonseparating cycles in K-Connected grap

Nonseparating cycles in K-Connected graphs

✍ Carsten Thomassen 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB 👁 1 views

## Abstract We show that every __k__‐connected graph with no 3‐cycle contains an edge whose contraction results in a __k__‐connected graph and use this to prove that every (__k__ + 3)‐connected graph contains a cycle whose deletion results in a __k__‐connected graph. This settles a problem of L. Lo

Intersections of Cycles in\(k\)-Connecte

Intersections of Cycles in\(k\)-Connected Graphs

✍ Chen, Jessica; Chen, Le; Liu, Derrick 📂 Article 📅 2014 🏛 Springer Japan 🌐 English ⚖ 783 KB

k-shredders in k-connected graphs

✍ Yoshimi Egawa 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract For a graph __G__, a subset __S__ of __V__(__G__) is called a shredder if __G__ − __S__ consists of three or more components. We show that if __k__ ≥ 4 and __G__ is a __k__‐connected graph, then the number of shredders of cardinality __k__ of __G__ is less than 2|__V__(__G__)|/3 (we sho

Intersections of Longest Cycles in k-Con

Intersections of Longest Cycles in k-Connected Graphs

✍ Guantao Chen; Ralph J Faudree; Ronald J Gould 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Let G be a connected graph, where k 2. S. Smith conjectured that every two longest cycles of G have at least k vertices in common. In this note, we show that every two longest cycles meet in at least ck 3Â5 vertices, where cr0.2615. ## 1998 Academic Press In this note, we provide a lower bound on

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