Weak and strong \(k\)-connectivity games (Q2509746): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993198489 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1203.3447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Winning strong games through fast strategies for weak games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast embedding of spanning trees in biased maker-breaker games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the clique-game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast winning strategies in maker-breaker games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two problems regarding the Hamiltonian cycle game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Solution of the Shannon Switching Game / rank
 
Normal rank

Latest revision as of 20:14, 8 July 2024

scientific article
Language Label Description Also known as
English
Weak and strong \(k\)-connectivity games
scientific article

    Statements

    Weak and strong \(k\)-connectivity games (English)
    0 references
    0 references
    0 references
    29 July 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    maker-breaker games
    0 references
    Hamilton cycle
    0 references
    perfect matching
    0 references
    \(k\)-connected graph
    0 references
    0 references
    0 references