The following pages link to Positional games (Q2438527):
Displaying 50 items.
- Waiter-Client and Client-Waiter planarity, colorability and minor games (Q271623) (← links)
- Creating cycles in walker-breaker games (Q284747) (← links)
- Client-waiter games on complete and random graphs (Q504971) (← links)
- Maker-Breaker domination game (Q776271) (← links)
- Random-player maker-breaker games (Q888617) (← links)
- Random strategies are nearly optimal for generalized van der Waerden games (Q1690015) (← links)
- Winning fast in biased maker-breaker games (Q1690027) (← links)
- Waiter-client triangle-factor game on the edges of the complete graph (Q2033901) (← links)
- Connector-breaker games on random boards (Q2040008) (← links)
- Maker-breaker resolving game (Q2045245) (← links)
- Waiter-client clique-factor game (Q2092418) (← links)
- On strong avoiding games (Q2111931) (← links)
- Fast winning strategies for the maker-breaker domination game (Q2132382) (← 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)
- Game saturation of intersecting families (Q2248514) (← links)
- Democratic fair allocation of indivisible goods (Q2289012) (← links)
- On the separation conjecture in avoider-enforcer games (Q2312614) (← links)
- Maker-breaker domination number (Q2317950) (← links)
- The toucher-isolator game (Q2327219) (← links)
- Waiter-client and client-waiter Hamiltonicity games on random graphs (Q2357219) (← links)
- Waiter-client and client-waiter colourability and \(k\)-SAT games (Q2363109) (← links)
- Strong Ramsey games: drawing on an infinite board (Q2397109) (← links)
- How fast can maker win in fair biased games? (Q2411594) (← links)
- New models of graph-bin packing (Q2629236) (← links)
- The threshold bias of the clique-factor game (Q2664555) (← links)
- The maker-breaker largest connected subgraph game (Q2680987) (← links)
- Thresholds for the monochromatic clique transversal game (Q2695001) (← links)
- The speed and threshold of the biased perfect matching and Hamilton cycle games (Q2696609) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals (Q2700612) (← links)
- On the threshold for the Maker-Breaker<i>H</i>-game (Q2830239) (← links)
- Building Spanning Trees Quickly in Maker-Breaker Games (Q2947437) (← links)
- Online Ramsey Numbers and the Subgraph Query Problem (Q3295265) (← links)
- Hamiltonian Maker–Breaker Games on Small Graphs (Q3383707) (← links)
- Ramsey, Paper, Scissors (Q3386531) (← links)
- Finding and Using Expanders in Locally Sparse Graphs (Q4604650) (← links)
- The Maker--Breaker Rado Game on a Random Set of Integers (Q4646256) (← links)
- On the subgraph query problem (Q4993118) (← links)
- Maker-Breaker Games on Randomly Perturbed Graphs (Q5013573) (← links)
- Spanning Structures in Walker–Breaker Games (Q5066070) (← links)
- Misère Tic-Tac-Toe on Projective Binary Steiner Triple Systems (Q5109354) (← links)
- Manipulative Waiters with Probabilistic Intuition (Q5366922) (← links)
- Maker-Breaker total domination game on cubic graphs (Q6045416) (← links)
- The Kℵ0$K^{\aleph _0}$ game: Vertex colouring (Q6048770) (← links)
- Maker Breaker on digraphs (Q6056764) (← links)
- \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs (Q6098463) (← links)
