Winning strong games through fast strategies for weak games
From MaRDI portal
Publication:553998
zbMath1222.05187MaRDI QIDQ553998
Publication date: 29 July 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/232024
Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (10)
Winning fast in fair biased maker-breaker games ⋮ Strong Ramsey games: drawing on an infinite board ⋮ How fast can maker win in fair biased games? ⋮ Building Spanning Trees Quickly in Maker-Breaker Games ⋮ Winning fast in biased maker-breaker games ⋮ Strong Ramsey games in unbounded time ⋮ Strong games played on random graphs ⋮ Sharp thresholds for half-random games. II ⋮ Weak and strong \(k\)-connectivity games ⋮ On strong avoiding games
This page was built for publication: Winning strong games through fast strategies for weak games
