Packing, counting and covering Hamilton cycles in random directed graphs (Q5890928)

From MaRDI portal
Revision as of 18:27, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6639451
Language Label Description Also known as
English
Packing, counting and covering Hamilton cycles in random directed graphs
scientific article; zbMATH DE number 6639451

    Statements

    title
    Packing, counting and covering Hamilton cycles in random directed graphs (English)
    0 references
    author
    Asaf Ferber
    0 references
    Gal Kronenberg
    0 references
    Eoin Long
    0 references
    publication date
    14 October 2016
    0 references
    Mathematics Subject Classification ID
    05C45
    0 references
    05C70
    0 references
    05C80
    0 references
    05C20
    0 references
    zbMATH DE Number
    6639451
    0 references
    zbMATH Keywords
    Hamilton cycles
    0 references
    random graphs
    0 references
    directed graphs
    0 references
    OpenAlex ID
    W2126781761
    0 references
    arXiv ID
    1506.00618
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5890928&oldid=36280018"
    Powered by MediaWiki