Eternal dominating sets on digraphs and orientations of graphs (Q2659065): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3115425321
@@ Property / OpenAlex ID: W3115425321 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.09623
@@ Property / arXiv ID: 1805.09623 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4820838
@@ Property / cites work: Q4820838 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5509547
@@ Property / cites work: Q5509547 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4681994
@@ Property / cites work: Q4681994 / rank @@
+Normal rank
@@ Property / cites work @@
+On Representatives of Subsets
@@ Property / cites work: On Representatives of Subsets / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5442507
@@ Property / cites work: Q5442507 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5441054
@@ Property / cites work: Q5441054 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3635564
@@ Property / cites work: Q3635564 / rank @@
+Normal rank
@@ Property / cites work @@
+Protecting a graph with mobile guards
@@ Property / cites work: Protecting a graph with mobile guards / rank @@
+Normal rank
@@ Property / cites work @@
+Q3158579
@@ Property / cites work: Q3158579 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank