Weak and strong \(k\)-connectivity games (Q2509746)

From MaRDI portal
Revision as of 20:14, 8 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
Weak and strong \(k\)-connectivity games
scientific article

    Statements

    title
    Weak and strong \(k\)-connectivity games (English)
    0 references
    author
    Asaf Ferber
    0 references
    Dan Hefetz
    0 references
    publication date
    29 July 2014
    0 references
    zbMATH Keywords
    maker-breaker games
    0 references
    Hamilton cycle
    0 references
    perfect matching
    0 references
    \(k\)-connected graph
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C57
    0 references
    05C40
    0 references
    05C55
    0 references
    91A43
    0 references
    91A05
    0 references
    zbMATH DE Number
    6322804
    0 references
    OpenAlex ID
    W1993198489
    0 references
    arXiv ID
    1203.3447
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2509746&oldid=35401444"
    Powered by MediaWiki