✦ LIBER ✦

Paths in k-edge-connected graphs

✍ Scribed by Haruko Okamura

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 562 KB
Volume: 45
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(88)90077-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Paths and edge-connectivity in graphs

✍ Haruko Okamura 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 903 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

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

Minimally (k, k)-edge-connected graphs

✍ Kamal Hennayake; Hong-Jian Lai; Deying Li; Jingzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract For an integer __l__ > 1, the __l__‐edge‐connectivity of a connected graph with at least __l__ vertices is the smallest number of edges whose removal results in a graph with __l__ components. A connected graph __G__ is (__k__, __l__)‐edge‐connected if the __l__‐edge‐connectivity of __G_

Induced paths in 5-connected graphs

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 75 KB 👁 2 views

We show that between any two vertices of a 5-connected graph there exists an induced path whose vertices can be removed such that the remaining graph is 2-connected.