A short note about pursuit games played on a graph with a given genus (Q1072462): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A game of cops and robbers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a class of isometric subgraphs of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex-to-vertex pursuit in a graph / rank | |||
Normal rank | |||
Latest revision as of 12:07, 17 June 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
