Name
Abstract | ||
|---|---|---|
Let D = (V, A) be a directed planar graph, let (t1, s1),...,(r(k), s(k)) be pairs of vertices on the boundary of the unbounded face, let A1,...,A(k) be subsets of A, and let H be a collection of unordered pairs from {1,...,k}. Given are necessary and sufficient conditions for the existence of a directed r(i)-s(i) path P(i) in (V, A(i)) (for i = 1,...,k), such that P(i) and P(j) are vertex-disjoint whenever {i, j} is-an-element-of H. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1137/0405009 | SIAM J. Discrete Math. |
Keywords | Field | DocType |
planar graph,general theorem,disjoint path | Discrete mathematics,Combinatorics,Tree (graph theory),Disjoint sets,Vertex (geometry),Directed graph,Planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
5 | 1 | 0895-4801 |
Citations | PageRank | References |
5 | 0.59 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guoli Ding | 1 | 444 | 51.58 |
| A. Schrijver | 2 | 10 | 2.52 |
| P. D. Seymour | 3 | 297 | 32.84 |