Matrices with the Edmonds-Johnson property (Q1100483): Difference between revisions

@@ Property / author @@
-Q787161
@@ Property / author: Q787161 / rank @@
-Normal rank
@@ Property / author @@
+Alexander Schrijver
@@ Property / author: Alexander Schrijver / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Polytope des independants d'un graphe série-parallèle
+Normal rank
@@ Property / cites work @@
+Edmonds polytopes and a hierarchy of combinatorial problems
+Normal rank
@@ Property / cites work @@
+On certain polytopes associated with graphs
@@ Property / cites work: On certain polytopes associated with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Q5675543
@@ Property / cites work: Q5675543 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching, Euler tours and the Chinese postman
@@ Property / cites work: Matching, Euler tours and the Chinese postman / rank @@
+Normal rank
@@ Property / cites work @@
+Transformations which Preserve Perfectness and H-Perfectness of Graphs
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+A class of h-perfect graphs
@@ Property / cites work: A class of h-perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The matroids with the max-flow min-cut property
@@ Property / cites work: The matroids with the max-flow min-cut property / rank @@
+Normal rank
@@ Property / cites work @@
+Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
+Normal rank