Back to Search
Start Over
Disjoint Paths in Decomposable Digraphs.
- Source :
-
Journal of Graph Theory . Jun2017, Vol. 85 Issue 2, p545-567. 23p. - Publication Year :
- 2017
-
Abstract
- The k-linkage problem is as follows: given a digraph [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 03649024
- Volume :
- 85
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Journal of Graph Theory
- Publication Type :
- Academic Journal
- Accession number :
- 122636928
- Full Text :
- https://doi.org/10.1002/jgt.22090