Edge-disjoint paths and cycles in n-edge
β
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