Abstract
Let G be a graph drawn on a disc, and let the vertices of G on the boundary of the disc be s1, ..., sk, t1, ..., tk in some order. When are there k vertex-disjoint paths of G joining si and ti (1 ≤ i ≤ k), respectively? We give a structural characterization and a polynomial algorithm for this problem. We also solve the same question when the disc is replaced by a cylinder.
Original language | English (US) |
---|---|
Pages (from-to) | 115-138 |
Number of pages | 24 |
Journal | Journal of Combinatorial Theory, Series B |
Volume | 41 |
Issue number | 1 |
DOIs | |
State | Published - Aug 1986 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics