Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969): Difference between revisions

@@ Property / cites work @@
+The parallel complexity of approximating the high degree subgraph problem
+Normal rank
@@ Property / cites work @@
+Q4234075
@@ Property / cites work: Q4234075 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of colouring problems on dense graphs
+Normal rank
@@ Property / cites work @@
+On the structure of linear graphs
@@ Property / cites work: On the structure of linear graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Ordered vertex removal and subgraph problems
@@ Property / cites work: Ordered vertex removal and subgraph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4843270
@@ Property / cites work: Q4843270 / rank @@
+Normal rank