Covering digraphs with small indegrees or outdegrees by directed cuts (Q389984): 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 @@
+Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
+Normal rank
@@ Property / cites work @@
+Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
+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 @@
+Arc colorings of digraphs
@@ Property / cites work: Arc colorings of digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum directed cuts in digraphs with degree restriction
+Normal rank
@@ Property / cites work @@
+On the arc-chromatic number of a digraph
@@ Property / cites work: On the arc-chromatic number of a digraph / rank @@
+Normal rank