✦ LIBER ✦

Edge-connectivity in -path graphs

✍ Scribed by C. Balbuena; P. García-Vázquez

Book ID: 108113457
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 184 KB
Volume: 286
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.05.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Paths in k-edge-connected graphs

✍ Haruko Okamura 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Paths and edge-connectivity in graphs

✍ Haruko Okamura 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 903 KB

Path-connectivity in graphs

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

Paths containing two adjacent edges in (

Paths containing two adjacent edges in (2k+1)-edge-connected graphs

✍ Haruko Okamura 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 424 KB

Edge-connectivity in p-partite graphs

✍ Lutz Volkmann 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

Let G = (V, €1 be a finite, simple p-partite graph with minimum degree 6 and edge-connectivity A. It is proved that if IVI d (2pS)/(p -1) -2 or in special cases that if IVI I ( 2 p 6 ) / ( p -1) -1, then A = S . It is further shown that this result is best possible.