Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts (Q418854): 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 @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+The biparticity of a graph
@@ Property / cites work: The biparticity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum directed cuts in digraphs with degree restriction
+Normal rank
@@ Property / cites work @@
+An inequality for the chromatic number of a graph
@@ Property / cites work: An inequality for the chromatic number of a graph / rank @@
+Normal rank