A short note about pursuit games played on a graph with a given genus (Q1072462)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A short note about pursuit games played on a graph with a given genus |
scientific article; zbMATH DE number 3941304
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A short note about pursuit games played on a graph with a given genus |
scientific article; zbMATH DE number 3941304 |
Statements
A short note about pursuit games played on a graph with a given genus (English)
0 references
1985
0 references
This is a short note about pursuit games played on a graph with a given genus. The main result of this paper is: if G is a graph with a given genus k, then \(3+2k\) pursuers are enough to catch the evader.
0 references
games on graphs
0 references
pursuit games
0 references
