A two-person game on graphs where each player tries to encircle his opponent's men
type: Item
instance of: scholarly article
title: A two-person game on graphs where each player tries to encircle his opponent's men
zbMATH Open document ID: 0916.90292
DOI: 10.1016/S0304-3975(98)00203-5
author: Thomas Andreae
author: Felix Hartenstein
author: Andrea Wolter
published in: Theoretical Computer Science
publication date: 1999-04-28T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A24
zbMATH DE Number: 1281085
zbMATH Keywords: combinatorial games
zbMATH Keywords: matchings and cycles in graphs
zbMATH Keywords: extremal graph theory
zbMATH Keywords: discrete pursuit-evasion games
MaRDI profile type: Publication
cites work: A game of cops and robbers
cites work: On a pursuit game played on graphs for which a minor is excluded
cites work: On independent cycles and edges in graphs
cites work: On bridged graphs and cop-win graphs
cites work: On the cop number of a graph
cites work: Q3852212
cites work: Q5422499
cites work: Pursuit—Evasion games on graphs
cites work: On the maximal number of independent circuits in a graph
cites work: On maximal paths and circuits of graphs
cites work: Q5342984
cites work: Q3348750
cites work: On a pursuit game on Cayley graphs
cites work: The complexity of pursuit on a graph
cites work: Searching and pebbling
cites work: Matching theory
cites work: The complexity of searching a graph
cites work: Vertex-to-vertex pursuit in a graph
cites work: Q4159394
cites work: A short note about pursuit games played on a graph with a given genus
cites work: Graph searching and a min-max theorem for tree-width
description: scientific article; zbMATH DE number 1281085