On two minimax theorems in graph (Q1229885): Difference between revisions

@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing rooted directed cuts in a weighted directed graph
+Normal rank
@@ Property / cites work @@
+Q3236252
@@ Property / cites work: Q3236252 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4060999
@@ Property / cites work: Q4060999 / 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 @@
+Strong Covering of a Bipartite Graph
@@ Property / cites work: Strong Covering of a Bipartite Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5586079
@@ Property / cites work: Q5586079 / rank @@
+Normal rank