ZIB

Hits per page

hit 1 - 1 | 1 hit

Select All Export

Electronic Resource

A sufficient condition for graphs to be weaklyk-linked (1991)

Huck, Andreas

Springer

Graphs and combinatorics 7 (1991), S. 323-351

add to mindlist on the mindlist

Details

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

URL: http://dx.doi.org/10.1007/BF01787639

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit