Fast winning strategies in avoider-enforcer games (Q844236): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: How long can a graph be kept planar? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On positional games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Biased Positional Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A universal planar graph under the minor relation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Avoider-Enforcer games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Planarity, Colorability, and Minor Games / 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: A Winning Strategy for the Ramsey Graph Game / rank | |||
Normal rank |
Revision as of 09:01, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast winning strategies in avoider-enforcer games |
scientific article |
Statements
Fast winning strategies in avoider-enforcer games (English)
0 references
18 January 2010
0 references
planarity
0 references
connectivity
0 references
bipartite
0 references