ISSN:
1435-5914

Source:
Springer Online Journal Archives 1860-2000

Topics:
Computer Science
,
Mathematics

Notes:
Abstract We consider graphs, which are finite, undirected, without loops and in which multiple edges are possible. For each natural numberk letg(k) be the smallest natural numbern, so that the following holds: LetG be ann-edge-connected graph and lets 1,...,s k,t 1,...,t k be vertices ofG. Then for everyi ∈ {1,..., k} there existsa pathP i froms i tot i, so thatP 1,...,P k are pairwise edge-disjoint. We prove $$g\left( k \right) \leqslant \left\{ {\begin{array}{*{20}c} {k + 1, if k is odd} \\ {k + 2, if k is even} \\ \end{array} } \right.$$

Type of Medium:
Electronic Resource

Permalink