A two-person game on graphs where each player tries to encircle his opponent's men
From MaRDI portal
Publication:1285593
DOI10.1016/S0304-3975(98)00203-5zbMath0916.90292MaRDI QIDQ1285593
Thomas Andreae, Felix Hartenstein, Andrea Wolter
Publication date: 28 April 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
combinatorial games; extremal graph theory; discrete pursuit-evasion games; matchings and cycles in graphs
91A05: 2-person games
91A43: Games involving graphs
91A24: Positional games (pursuit and evasion, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of pursuit on a graph
- A game of cops and robbers
- A short note about pursuit games played on a graph with a given genus
- Matching theory
- On a pursuit game on Cayley graphs
- On a pursuit game played on graphs for which a minor is excluded
- On bridged graphs and cop-win graphs
- Graph searching and a min-max theorem for tree-width
- On the cop number of a graph
- Searching and pebbling
- Vertex-to-vertex pursuit in a graph
- On independent cycles and edges in graphs
- On maximal paths and circuits of graphs
- The complexity of searching a graph
- Pursuit—Evasion games on graphs
- On the maximal number of independent circuits in a graph