✦ LIBER ✦

Relative lengths of paths and cycles in k-connected graphs

✍ Scribed by S.C Locke

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 583 KB
Volume: 32
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(82)90036-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Relative length of longest paths and cyc

Relative length of longest paths and cycles in 3-connected graphs

✍ Rao Li; Akira Saito; R.H. Schelp 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 2 views

## Abstract For a graph __G__, let __p(G)__ denote the order of a longest path in __G__ and __c(G)__ the order of a longest cycle in __G__, respectively. We show that if __G__ is a 3‐connected graph of order __n__ such that $\textstyle{\sum^{4}\_{i=1}\,{\rm deg}\_{G}\,x\_{i} \ge {3\over2}\,n + 1}$

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

Edge-disjoint paths and cycles in n-edge

Edge-disjoint paths and cycles in n-edge-connected graphs

✍ Andreas Huck 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 826 KB

## Abstract We consider finite undirected loopless graphs __G__ in which multiple edges are possible. For integers k,l ≥ 0 let g(k, l) be the minimal __n__ ≥ 0 with the following property: If __G__ is an __n__‐edge‐connected graph, __s__~1~, ⃛,__s__~k~, __t__~1~, ⃛,__t__~k~ are vertices of __G__, a

Relative length of long paths and cycles

Relative length of long paths and cycles in graphs with large degree sums

✍ Hikoe Enomoto; Jan van den Heuvel; Atsushi Kaneko; Akira Saito 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 601 KB

## Abstract For a graph __G, p__(__G__) denotes the order of a longest path in __G__ and __c__(__G__) the order of a longest cycle. We show that if __G__ is a connected graph __n__ ≥ 3 vertices such that __d__(__u__) + __d__(__v__) + __d__(__w__) ≧ n for all triples __u, v, w__ of independent verti

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