Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs (Q3145840)

From MaRDI portal
Revision as of 00:27, 6 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
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
scientific article

    Statements

    title
    Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs (English)
    0 references
    DOI
    10.1002/rsa.20471
    0 references
    author
    František Kardoš
    0 references
    Jan Volec
    0 references
    Daniel Král'
    0 references
    publication date
    14 December 2012
    0 references
    zbMATH DE Number
    6115880
    0 references
    zbMATH Keywords
    cubic graphs
    0 references
    random graphs
    0 references
    large girth
    0 references
    edge-cut
    0 references
    describes a project that uses
    MPFR
    0 references
    mctoolbox
    0 references
    Mulprec
    0 references
    OpenAlex ID
    W3125518523
    0 references
    Wikidata QID
    Q57601386
    0 references
    arXiv ID
    1108.6280
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3145840&oldid=35312669"
    Powered by MediaWiki