The following pages link to Biased Positional Games (Q4152069):
Displaying 50 items.
- Waiter-Client and Client-Waiter planarity, colorability and minor games (Q271623) (← links)
- Creating cycles in walker-breaker games (Q284747) (← links)
- A non-trivial upper bound on the threshold bias of the oriented-cycle game (Q345067) (← links)
- Avoider-Enforcer games played on edge disjoint hypergraphs (Q394298) (← links)
- Avoider-forcer games on hypergraphs with small rank (Q405059) (← links)
- Biased orientation games (Q418878) (← links)
- Fast embedding of spanning trees in biased maker-breaker games (Q427795) (← links)
- The game chromatic number of dense random graphs (Q490261) (← links)
- Generalized pairing strategies -- a bridge from pairing strategies to colorings (Q508633) (← links)
- Global maker-breaker games on sparse graphs (Q616371) (← links)
- On the clique-game (Q649002) (← links)
- The picker-chooser diameter game (Q708229) (← links)
- Maker-Breaker domination game (Q776271) (← links)
- A remark on the tournament game (Q888601) (← links)
- Random-player maker-breaker games (Q888617) (← links)
- Avoider-enforcer: the rules of the game (Q966059) (← links)
- Van der Waerden and Ramsey type games (Q1054728) (← links)
- Directed switching games on graphs and matroids (Q1074519) (← links)
- A solution to the Box Game (Q1095050) (← links)
- Random strategies are nearly optimal for generalized van der Waerden games (Q1690015) (← links)
- Winning fast in biased maker-breaker games (Q1690027) (← links)
- A new upper bound on the game chromatic index of graphs (Q1753125) (← links)
- Biased positional games on matroids (Q1765611) (← links)
- Variations on a game (Q1836601) (← links)
- A note on biased and non-biased games (Q1894371) (← links)
- A Hamiltonian game on \(K_{n,n}\) (Q1896354) (← links)
- Maker-breaker percolation games. II: Escaping to infinity (Q1984532) (← links)
- Sharp thresholds for half-random games. II (Q2014222) (← links)
- Connector-breaker games on random boards (Q2040008) (← links)
- On strong avoiding games (Q2111931) (← links)
- A new bound for the Maker-Breaker triangle game (Q2143405) (← links)
- On the WalkerMaker-WalkerBreaker games (Q2181217) (← links)
- Maker-breaker total domination game (Q2185735) (← links)
- On the odd cycle game and connected rules (Q2198973) (← links)
- Fast strategies in Waiter-Client games (Q2200433) (← links)
- Keeping avoider's graph almost acyclic (Q2260635) (← links)
- On the separation conjecture in avoider-enforcer games (Q2312614) (← links)
- The toucher-isolator game (Q2327219) (← links)
- Waiter-client and client-waiter Hamiltonicity games on random graphs (Q2357219) (← links)
- Avoider-Enforcer games (Q2371294) (← links)
- Fast winning strategies in maker-breaker games (Q2519013) (← links)
- The threshold bias of the clique-factor game (Q2664555) (← links)
- The maker-breaker largest connected subgraph game (Q2680987) (← links)
- The speed and threshold of the biased perfect matching and Hamilton cycle games (Q2696609) (← links)
- Biased positional games and the phase transition (Q2712577) (← links)
- Avoider-Enforcer: the rules of the game (Q2851474) (← links)
- Playing to retain the advantage (Q2851498) (← links)
- Hitting time results for maker-breaker games (Q2909241) (← links)
- A threshold for the maker-breaker clique game (Q2925528) (← links)
- Walker-Breaker Games (Q2944455) (← links)
