A short note about pursuit games played on a graph with a given genus (Q1072462): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q457865 |
||
| Property / reviewed by | |||
| Property / reviewed by: Irinel Dragan / rank | |||
Revision as of 10:27, 15 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A short note about pursuit games played on a graph with a given genus |
scientific article |
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
