On the problem of finding disjoint cycles and dicycles in a digraph
- 28 December 2011
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 31 (6) , 639-668
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Disjoint directed and undirected paths and cycles in digraphsTheoretical Computer Science, 2009
- Disjoint Paths in Acyclic DigraphsJournal of Combinatorial Theory, Series B, 1993
- The 2-linkage problem for acyclic digraphsDiscrete Mathematics, 1985
- Disjoint cycles in digraphsCombinatorica, 1983
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- Some Results Concerning the Structure of GraphsCanadian Mathematical Bulletin, 1963