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

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0095-8956(76)90049-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2073834089
@@ Property / OpenAlex ID: W2073834089 / rank @@
+Normal rank
@@ 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