Computing the one-visibility copnumber of trees (Q2039691): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-57602-8_37
+Normal rank
@@ Property / OpenAlex ID @@
+W3047829504
@@ Property / OpenAlex ID: W3047829504 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3090934
@@ Property / cites work: Q3090934 / rank @@
+Normal rank
@@ Property / cites work @@
+Limited visibility cops and robber
@@ Property / cites work: Limited visibility cops and robber / rank @@
+Normal rank
@@ Property / cites work @@
+Zero-visibility cops and robber and the pathwidth of a graph
+Normal rank
@@ Property / cites work @@
+The complexity of zero-visibility cops and robber
@@ Property / cites work: The complexity of zero-visibility cops and robber / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of searching a graph
@@ Property / cites work: The complexity of searching a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-to-vertex pursuit in a graph
@@ Property / cites work: Vertex-to-vertex pursuit in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4724424
@@ Property / cites work: Q4724424 / rank @@
+Normal rank
@@ Property / cites work @@
+New results on the zero-visibility cops and robber game
+Normal rank
@@ Property / cites work @@
+A partition approach to lower bounds for zero-visibility cops and robber
+Normal rank