Almost all cop-win graphs contain a universal vertex (Q418869)

From MaRDI portal
Revision as of 07:25, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Almost all cop-win graphs contain a universal vertex
scientific article

    Statements

    title
    Almost all cop-win graphs contain a universal vertex (English)
    0 references
    author
    Anthony Bonato
    0 references
    Graeme Kemkes
    0 references
    Paweł Prałat
    0 references
    publication date
    30 May 2012
    0 references
    zbMATH DE Number
    6039216
    0 references
    zbMATH Keywords
    cop-win graph
    0 references
    random graphs
    0 references
    universal vertex
    0 references
    cop-win ordering
    0 references
    OpenAlex ID
    W2079449107
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q418869&oldid=35281525"
    Powered by MediaWiki