✦ LIBER ✦

Cycles through k+2 vertices in k-connected graphs

✍ Scribed by N. Tsikopoulos

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 73 KB
Volume: 50
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90040-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Cycles and paths through specified verti

Cycles and paths through specified vertices in k-connected graphs

✍ Y Egawa; R Glas; S.C Locke 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 693 KB

Circuits through prescribed vertices in

Circuits through prescribed vertices in k-connected k-regular graphs

✍ Roland Häggkvist; Wolfgang Mader 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB 👁 1 views

## Abstract We show that every set of $k+\lfloor{1\over 3}\sqrt{k}\rfloor$ vertices in a __k__‐connected __k__‐regular graph belongs to some circuit. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 145–163, 2002

Cycles through edges in cyclically k–con

Cycles through edges in cyclically k–connected cubic graphs

✍ William McCuaig 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 247 KB

McCuaig, W., Cycles through edges in cyclically k-connected cubic graphs

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 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