✦ LIBER ✦

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

✍ Scribed by Chen, Jessica; Chen, Le; Liu, Derrick

Book ID: 125345630
Publisher: Springer Japan
Year: 2014
Tongue: English
Weight: 783 KB
Volume: 31
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-014-1427-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

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

k-connectivity of uniform s-intersection

k-connectivity of uniform s-intersection graphs

✍ Bloznelis, Mindaugas; Rybarczyk, Katarzyna 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Cycles in cube-connected cycles graphs

✍ Hsu, Lih-Hsing; Ho, Tung-Yang; Ho, Yen-Hsun; Tsay, Chey-Woei 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 1000 KB

Cycles passing through k + 1 vertices in

Cycles passing through k + 1 vertices in k-connected graphs

✍ Jun Fujisawa; Tomoki Yamashita 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

## Abstract In this article, we prove the following theorem. Let __k__ ≥ 3 be an integer, __G__ be a __k__‐connected graph with minimum degree __d__ and __X__ be a set of __k__ + 1 vertices on a cycle. Then __G__ has a cycle of length at least min {2d,|V(G)|} passing through __X__. This result give