On the public citation graph
On a pursuit game on cayley graphs
0 signed · 40 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02579157openalex-snapshot
Explicit construction of regular graphs without small cycles
inferredcites →https://doi.org/10.1007/bf02579283openalex-snapshot
Explicit constructions of graphs without short cycles and low density codes
inferredcites →https://doi.org/10.1016/0095-8956(86)90026-2openalex-snapshot
On a pursuit game played on graphs for which a minor is excluded
inferredcites →https://doi.org/10.1016/0166-218x(84)90012-xopenalex-snapshot
Note on a pursuit game played on graphs
inferredcites →https://doi.org/10.1016/0166-218x(84)90073-8openalex-snapshot
A game of cops and robbers
inferredcites →https://doi.org/10.1016/0166-218x(87)90033-3openalex-snapshot
Cops and robbers in graphs with large girth and Cayley graphs
inferredcites →https://doi.org/10.1016/0166-218x(87)90034-5openalex-snapshot
On a game of policemen and robber
inferredcites →https://doi.org/10.1016/s0195-6698(87)80034-3openalex-snapshot
On a Pursuit Game on Cayley Digraphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22129openalex-snapshot
Cops and Robbers on Planar‐Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_12openalex-snapshot
On tractability of Cops and Robbers game
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_6openalex-snapshot
On the Monotonicity of Weak Searching
inferred← citeshttps://doi.org/10.1007/978-94-011-2080-7_21openalex-snapshot
A Vertex-to-Vertex Pursuit Game Played With Disjoint Sets of Edges
inferred← citeshttps://doi.org/10.1007/s00373-022-02460-8openalex-snapshot
Meyniel Extremal Families of Abelian Cayley Graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90033-3openalex-snapshot
Cops and robbers in graphs with large girth and Cayley graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(95)80012-3openalex-snapshot
The complexity of pursuit on a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2017.03.004openalex-snapshot
The game of Cops and Robber on circulant graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.012openalex-snapshot
4-cop-win graphs have at least 19 vertices
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.038openalex-snapshot
A note on k -cop, l -robber games on graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.06.002openalex-snapshot
A proof of the Meyniel conjecture for Abelian Cayley graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103383openalex-snapshot
Cops and robbers on directed and undirected abelian Cayley graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104168openalex-snapshot
On the cop number and the weak Meyniel conjecture for algebraic graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.040openalex-snapshot
An annotated bibliography on guaranteed graph searching
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.025openalex-snapshot
Monotonicity in digraph search problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.12.010openalex-snapshot
Pursuing a fast robber on a graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.041openalex-snapshot
Fighting constrained fires in graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.033openalex-snapshot
The one-cop-moves game on graphs with some special structures
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00165-9openalex-snapshot
A game of cops and robbers played on products of graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00203-5openalex-snapshot
A two-person game on graphs where each player tries to encircle his opponent's men
inferred← citeshttps://doi.org/10.1017/9781316135167.033openalex-snapshot
Combinatorial Games: Selected Bibliography With A Succinct Gourmet Introduction
inferred← citeshttps://doi.org/10.1017/s0963548312000338openalex-snapshot
Cops and Robbers on Geometric Graphs
inferred← citeshttps://doi.org/10.1137/17m1152589openalex-snapshot
Smarter Lions: Efficient Cooperative Pursuit in General Bounded Arenas
inferred← citeshttps://doi.org/10.1184/r1/6477155openalex-snapshot
Cops and Robbers on Geometric Graphs
inferred← citeshttps://doi.org/10.32920/ryerson.14649297openalex-snapshot
Cops and robbers on graphs and hypergraphs
inferred← citeshttps://doi.org/10.32920/ryerson.14649297.v1openalex-snapshot
Cops and robbers on graphs and hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1408.6350openalex-snapshot
Definition and properties to assess multi-agent environments as social intelligence tests
inferred← citeshttps://doi.org/10.4995/thesis/10251/66080openalex-snapshot
Towards a Universal Test of Social Intelligence
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.