A two-person game on graphs where each player tries to encircle his opponent's men

DOI10.1016/S0304-3975(98)00203-5zbMath0916.90292MaRDI QIDQ1285593

Felix Hartenstein, Thomas Andreae, Andrea Wolter

Publication date: 28 April 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

combinatorial gamesextremal graph theorydiscrete pursuit-evasion gamesmatchings and cycles in graphs

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (3)

Game with Slow Pursuers on the Edge Graphs of Regular Simplexes ⋮ Differential Game with Slow Pursuers on the Edge Graph of a Simplex ⋮ A pursuit-evasion differential game with slow pursuers on the edge graph of a simplex. I

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

This page was built for publication: A two-person game on graphs where each player tries to encircle his opponent's men