Complexity and monotonicity results for domination games (Q266262): Difference between revisions

@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
+Normal rank
@@ Property / cites work @@
+Q4699283
@@ Property / cites work: Q4699283 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+An annotated bibliography on guaranteed graph searching
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+On the domination search number
@@ Property / cites work: On the domination search number / rank @@
+Normal rank
@@ Property / cites work @@
+Eavesdropping games
@@ Property / cites work: Eavesdropping games / rank @@
+Normal rank
@@ Property / cites work @@
+Searching and pebbling
@@ Property / cites work: Searching and pebbling / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of graphs with bounded asteroidal number
+Normal rank
@@ Property / cites work @@
+Distance d-Domination Games
@@ Property / cites work: Distance d-Domination Games / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph searching and a min-max theorem for tree-width
+Normal rank