Complexity of finding k-path-free dominating sets in graphs (Q1167535): Difference between revisions

@@ Property / cites work @@
+Q4050630
@@ Property / cites work: Q4050630 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4065548
@@ Property / cites work: Q4065548 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5672651
@@ Property / cites work: Q5672651 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3883524
@@ Property / cites work: Q3883524 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5581642
@@ Property / cites work: Q5581642 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585195
@@ Property / cites work: Q5585195 / rank @@
+Normal rank
@@ Property / cites work @@
+Problems and methods with multiple objective functions
+Normal rank