On a pursuit game on Cayley graphs
From MaRDI portal
Publication:1090336
DOI10.1007/BF02579201zbMath0621.05017MaRDI QIDQ1090336
Publication date: 1987
Published in: Combinatorica (Search for Journal in Brave)
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (17)
Variations on cops and robbers ⋮ Cops and Robbers on Geometric Graphs ⋮ Relator Games on Groups ⋮ Smarter Lions: Efficient Cooperative Pursuit in General Bounded Arenas ⋮ Fighting constrained fires in graphs ⋮ A note on \(k\)-cop, \(l\)-robber games on graphs ⋮ The one-cop-moves game on graphs with some special structures ⋮ An annotated bibliography on guaranteed graph searching ⋮ The complexity of pursuit on a graph ⋮ The game of Cops and Robber on circulant graphs ⋮ Pursuing a fast robber on a graph ⋮ A proof of the Meyniel conjecture for abelian Cayley graphs ⋮ 4-cop-win graphs have at least 19 vertices ⋮ Cops and robbers on directed and undirected abelian Cayley graphs ⋮ A two-person game on graphs where each player tries to encircle his opponent's men ⋮ A game of cops and robbers played on products of graphs ⋮ Meyniel extremal families of abelian Cayley graphs
Cites Work
- Unnamed Item
- Explicit construction of regular graphs without small cycles
- A game of cops and robbers
- Note on a pursuit game played on graphs
- Cops and robbers in graphs with large girth and Cayley graphs
- On a pursuit game on Cayley digraphs
- On a pursuit game played on graphs for which a minor is excluded
- Explicit constructions of graphs without short cycles and low density codes
- On a game of policemen and robber
This page was built for publication: On a pursuit game on Cayley graphs
