Intersection properties of maximal directed cuts in digraphs (Q329544): Difference between revisions

@@ Property / cites work @@
+Maximum directed cuts in acyclic digraphs
@@ Property / cites work: Maximum directed cuts in acyclic digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
+Normal rank
@@ Property / cites work @@
+Online Maximum Directed Cut
@@ Property / cites work: Online Maximum Directed Cut / rank @@
+Normal rank
@@ Property / cites work @@
+Online maximum directed cut
@@ Property / cites work: Online maximum directed cut / rank @@
+Normal rank
@@ Property / cites work @@
+Cut-primitive directed graphs versus clan-primitive directed graphs
+Normal rank
@@ Property / cites work @@
+Directed cut transversal packing for source-sink connected graphs
+Normal rank
@@ Property / cites work @@
+Maximum directed cuts in digraphs with degree restriction
+Normal rank
@@ Property / cites work @@
+On two minimax theorems in graph
@@ Property / cites work: On two minimax theorems in graph / 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 @@
+Excluding a simple good pair approach to directed cuts
+Normal rank
@@ Property / cites work @@
+Maximum directed cuts in graphs with degree constraints
+Normal rank
@@ Property / cites work @@
+Covering digraphs with small indegrees or outdegrees by directed cuts
+Normal rank