A minimax theorem on circuits in projective graphs (Q1255022): Difference between revisions

@@ Property / author @@
-Sóstenes Lins
@@ Property / author: Sóstenes Lins / rank @@
-Normal rank
@@ Property / author @@
+Sóstenes Lins
@@ Property / author: Sóstenes Lins / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0095-8956(81)90042-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2093048092
@@ Property / OpenAlex ID: W2093048092 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3216677
@@ Property / cites work: Q3216677 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
+Normal rank
@@ Property / cites work @@
+Multicommodity flows in planar graphs
@@ Property / cites work: Multicommodity flows in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+-Matchings and 2-covers of hypergraphs
@@ Property / cites work: 2-Matchings and 2-covers of hypergraphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1255022