Pages that link to "Item:Q2509746"
From MaRDI portal
The following pages link to Weak and strong \(k\)-connectivity games (Q2509746):
Displaying 15 items.
- Creating cycles in walker-breaker games (Q284747) (← links)
- Winning fast in fair biased maker-breaker games (Q322263) (← links)
- Strong games played on random graphs (Q510354) (← links)
- Random-player maker-breaker games (Q888617) (← links)
- Winning fast in biased maker-breaker games (Q1690027) (← links)
- Strong Ramsey games in unbounded time (Q1987092) (← links)
- Sharp thresholds for half-random games. II (Q2014222) (← links)
- On strong avoiding games (Q2111931) (← links)
- Fast strategies in Waiter-Client games (Q2200433) (← links)
- Strong Ramsey games: drawing on an infinite board (Q2397109) (← links)
- How fast can maker win in fair biased games? (Q2411594) (← links)
- Building Spanning Trees Quickly in Maker-Breaker Games (Q2947437) (← links)
- Generating random graphs in biased Maker-Breaker games (Q3460510) (← links)
- Biased games on random boards (Q5265341) (← links)
- Efficient Winning Strategies in Random‐Turn Maker–Breaker Games (Q5272928) (← links)
