On digraphs with no two disjoint directed cycles (Q1092919): Difference between revisions

@@ Property / cites work @@
+On the number of cycles possible in digraphs with large girth
+Normal rank
@@ Property / cites work @@
+Cycles in digraphs– a survey
@@ Property / cites work: Cycles in digraphs– a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Some Results Concerning the Structure of Graphs
@@ Property / cites work: Some Results Concerning the Structure of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On cycles of directed graphs
@@ Property / cites work: On cycles of directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+On independent circuits of a digraph
@@ Property / cites work: On independent circuits of a digraph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3309861
@@ Property / cites work: Q3309861 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5530472
@@ Property / cites work: Q5530472 / rank @@
+Normal rank
@@ Property / cites work @@
+A Minimax Theorem for Directed Graphs
@@ Property / cites work: A Minimax Theorem for Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The 2-linkage problem for acyclic digraphs
@@ Property / cites work: The 2-linkage problem for acyclic digraphs / rank @@
+Normal rank