✦ LIBER ✦

Corrigendum: Edge-Disjoint Paths in Expander Graphs

✍ Scribed by Frieze, Alan

Book ID: 118180425
Publisher: Society for Industrial and Applied Mathematics
Year: 2001
Tongue: English
Weight: 52 KB
Volume: 31
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539701395097

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-Disjoint Paths in Expander Graphs

✍ Frieze, Alan M. 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 170 KB

Edge-disjoint paths in planar graphs

✍ András Frank 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 989 KB

Edge Disjoint Paths in Moderately Connec

Edge Disjoint Paths in Moderately Connected Graphs

✍ Rao, Satish; Zhou, Shuheng 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 424 KB

Vertex-disjoint paths and edge-disjoint

Vertex-disjoint paths and edge-disjoint branchings in directed graphs

✍ R. W. Whitty 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

A theorem of J. Edmonds states that a directed graph has k edge-disjoint branchings rooted at a vertex r if and only if every vertex has k edge-disjoint paths to r . We conjecture an extension of this theorem to vertex-disjoint paths and give a constructive proof of the conjecture in the case k = 2.

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

Arc-Disjoint Paths in Expander Digraphs

✍ Bohman, Tom; Frieze, Alan 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 235 KB