The 2-linkage problem for acyclic digraphs
- 31 December 1985
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 55 (1) , 73-87
- https://doi.org/10.1016/s0012-365x(85)80022-4
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the number of cycles possible in digraphs with large girthDiscrete Applied Mathematics, 1985
- Disjoint cycles in digraphsCombinatorica, 1983
- Cycles in digraphs– a surveyJournal of Graph Theory, 1981
- 2-Linked GraphsEuropean Journal of Combinatorics, 1980
- Planarity and duality of finite and infinite graphsJournal of Combinatorial Theory, Series B, 1980
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- Disjoint paths in graphsDiscrete Mathematics, 1980
- On independent circuits of a digraphJournal of Graph Theory, 1977
- Efficient Planarity TestingJournal of the ACM, 1974