Maximum directed cuts in digraphs with degree restriction (Q3633002): Difference between revisions

@@ Property / OpenAlex ID @@
+W4214844729
@@ Property / OpenAlex ID: W4214844729 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.3958
@@ Property / arXiv ID: 0711.3958 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum directed cuts in acyclic digraphs
@@ Property / cites work: Maximum directed cuts in acyclic digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Largest bipartite subgraphs in triangle-free graphs with maximum degree three
+Normal rank
@@ Property / cites work @@
+On incidence coloring and star arboricity of graphs
+Normal rank
@@ Property / cites work @@
+MAX CUT in cubic graphs
@@ Property / cites work: MAX CUT in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Triangle-free partial graphs and edge covering theorems
+Normal rank
@@ Property / cites work @@
+Triangle-free subcubic graphs with minimum bipartite density
+Normal rank
@@ Property / cites work @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank