A short note about pursuit games played on a graph with a given genus (Q1072462)

From MaRDI portal
Revision as of 00:11, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    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
    0 references
    games on graphs
    0 references
    pursuit games
    0 references

    Identifiers