Pages that link to "Item:Q2519013"
From MaRDI portal
The following pages link to Fast winning strategies in maker-breaker games (Q2519013):
Displaying 43 items.
- Creating cycles in walker-breaker games (Q284747) (← links)
- Winning fast in fair biased maker-breaker games (Q322263) (← links)
- Fast embedding of spanning trees in biased maker-breaker games (Q427795) (← links)
- Strong games played on random graphs (Q510354) (← links)
- Winning strong games through fast strategies for weak games (Q553998) (← links)
- Global maker-breaker games on sparse graphs (Q616371) (← links)
- Fast winning strategies in avoider-enforcer games (Q844236) (← links)
- Random-player maker-breaker games (Q888617) (← links)
- On winning fast in Avoider-Enforcer games (Q976704) (← links)
- On two problems regarding the Hamiltonian cycle game (Q1010935) (← links)
- A matching game (Q1182968) (← links)
- Winning fast in biased maker-breaker games (Q1690027) (← links)
- Sharp thresholds for half-random games. II (Q2014222) (← links)
- Waiter-client triangle-factor game on the edges of the complete graph (Q2033901) (← links)
- A strategy for isolator in the toucher-isolator game on trees (Q2064906) (← links)
- Fast winning strategies for the maker-breaker domination game (Q2132382) (← links)
- On the WalkerMaker-WalkerBreaker games (Q2181217) (← links)
- On the odd cycle game and connected rules (Q2198973) (← links)
- Fast strategies in Waiter-Client games (Q2200433) (← links)
- Blockers for triangulations of a convex polygon and a geometric maker-breaker game (Q2205124) (← links)
- Maker-breaker domination number (Q2317950) (← links)
- The toucher-isolator game (Q2327219) (← links)
- Strong Ramsey games: drawing on an infinite board (Q2397109) (← links)
- How fast can maker win in fair biased games? (Q2411594) (← links)
- Weak and strong \(k\)-connectivity games (Q2509746) (← links)
- The speed and threshold of the biased perfect matching and Hamilton cycle games (Q2696609) (← links)
- Fast embedding of spanning trees in biased maker-breaker games (Q2857367) (← links)
- Hitting time results for maker-breaker games (Q2909241) (← links)
- Walker-Breaker Games (Q2944455) (← links)
- Building Spanning Trees Quickly in Maker-Breaker Games (Q2947437) (← links)
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛 (Q3074554) (← links)
- Fast Strategies In Maker–Breaker Games Played on Random Boards (Q3168447) (← links)
- Hamiltonian Maker–Breaker Games on Small Graphs (Q3383707) (← links)
- Generating random graphs in biased Maker-Breaker games (Q3460510) (← links)
- Fast winning strategies in positional games (Q3503475) (← links)
- Spanning Structures in Walker–Breaker Games (Q5066070) (← links)
- Biased games on random boards (Q5265341) (← links)
- Efficient Winning Strategies in Random‐Turn Maker–Breaker Games (Q5272928) (← links)
- The Game Saturation Number of a Graph (Q5272930) (← links)
- \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs (Q6098463) (← links)
- Maker-breaker domination game on trees when Staller wins (Q6599796) (← links)
- Maker-breaker domination number for Cartesian products of path graphs \(P_2\) and \(P_n\) (Q6599808) (← links)
- Complexity of maker-breaker games on edge sets of graphs (Q6657252) (← links)
