ISSN:
1435-5914
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract Suppose thatk ≥ 1 is an odd integer, (s 1,t 1),..., (s k〉 ,t k ) are pairs of vertices of a graphG andλ(s i ,t i ) is the maximal number of edge-disjoint paths betweens i andt i . We prove that ifλ(s i ,t i )≥ k (1≤ i ≤ k) and |{s 1,...s k ,t 1,...,t k }| ≤ 6, then there exist edge-disjoint pathsP 1,...,P k such thatP i has endss i andt i (1≤ i ≤ k).
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01788539
Permalink