A note on \(k\)-cop, \(l\)-robber games on graphs (Q2433710): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2005.12.038
+Normal rank
@@ Property / OpenAlex ID @@
+W2012220350
@@ Property / OpenAlex ID: W2012220350 / rank @@
+Normal rank
@@ Property / cites work @@
+On bridged graphs and cop-win graphs
@@ Property / cites work: On bridged graphs and cop-win graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5460876
@@ Property / cites work: Q5460876 / rank @@
+Normal rank
@@ Property / cites work @@
+On a pursuit game on Cayley graphs
@@ Property / cites work: On a pursuit game on Cayley graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of pursuit on a graph
@@ Property / cites work: The complexity of pursuit on a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On cop-win graphs
@@ Property / cites work: On cop-win graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On a pursuit game on Cayley digraphs
@@ Property / cites work: On a pursuit game on Cayley digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4881856
@@ Property / cites work: Q4881856 / 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