A short note about pursuit games played on a graph with a given genus

DOI10.1016/0095-8956(85)90093-0zbMath0586.90104OpenAlexW2036303537MaRDI QIDQ1072462

Alain Quilliot

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90093-0

zbMATH Keywords

games on graphspursuit games

Mathematics Subject Classification ID

Positional games (pursuit and evasion, etc.) (91A24)

Related Items (40)

Variations on cops and robbers ⋮ Chromatic numbers of exact distance graphs ⋮ Fast Robber in Planar Graphs ⋮ On Meyniel's conjecture of the cop number ⋮ On a pursuit game played on graphs for which a minor is excluded ⋮ Cops and robbers on intersection graphs ⋮ The game of cops and robbers on directed graphs with forbidden subgraphs ⋮ A cops and robber game in multidimensional grids ⋮ Parameterized pursuit-evasion games ⋮ Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs ⋮ Implementation of sequential game on quantum circuits ⋮ How to hunt an invisible rabbit on a graph ⋮ On positionality of trigger strategies Nash equilibria in SCAR ⋮ A note on the cops and robber game on graphs embedded in non-orientable surfaces ⋮ On the generalised colouring numbers of graphs that exclude a fixed minor ⋮ An annotated bibliography on guaranteed graph searching ⋮ \(k\)-chordal graphs: from cops and robber to compact routing via treewidth ⋮ The complexity of pursuit on a graph ⋮ On the cop number of toroidal graphs ⋮ Catching a Fast Robber on Interval Graphs ⋮ On the generalised colouring numbers of graphs that exclude a fixed minor ⋮ Bounding the Cop Number of a Graph by Its Genus ⋮ Pursuing a fast robber on a graph ⋮ Revolutionaries and spies ⋮ A survey on the relationship between the game of cops and robbers and other game representations ⋮ Large classes of infinite k-cop-win graphs ⋮ Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs ⋮ Cops and robbers on directed and undirected abelian Cayley graphs ⋮ The one-cop-moves game on planar graphs ⋮ Guarding a subgraph as a tool in pursuit-evasion games ⋮ A witness version of the cops and robber game ⋮ On a game of policemen and robber ⋮ Some game-theoretic remarks on two-player generalized cops and robbers games ⋮ A two-person game on graphs where each player tries to encircle his opponent's men ⋮ Cops, a fast robber and defensive domination on interval graphs ⋮ A game of cops and robbers played on products of graphs ⋮ Conjectures on Cops and Robbers ⋮ Note on a pursuit game played on graphs ⋮ Noise controlling entangling operators in the quantum network implementation of cop and robber game ⋮ Meyniel extremal families of abelian Cayley graphs

Cites Work

• A game of cops and robbers
• Vertex-to-vertex pursuit in a graph
• On a class of isometric subgraphs of a graph

This page was built for publication: A short note about pursuit games played on a graph with a given genus