How to hunt an invisible rabbit on a graph (Q896060)

From MaRDI portal
Revision as of 01:02, 3 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60488376, #quickstatements; #temporary_batch_1712101902020)
scientific article
Language Label Description Also known as
English
How to hunt an invisible rabbit on a graph
scientific article

    Statements

    title
    How to hunt an invisible rabbit on a graph (English)
    0 references
    author
    Fedor V. Fomin
    0 references
    Petr A. Golovach
    0 references
    Michał Pilipczuk
    0 references
    publication date
    11 December 2015
    0 references
    zbMATH Keywords
    Hunters \& Rabbit game
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C57
    0 references
    91A43
    0 references
    91A24
    0 references
    zbMATH DE Number
    6520146
    0 references
    OpenAlex ID
    W1855571088
    0 references
    Wikidata QID
    Q60488376
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q896060&oldid=33225546"
    Powered by MediaWiki