The following pages link to Combinatorial Games (Q5386139):
Displaying 50 items.
- Waiter-Client and Client-Waiter planarity, colorability and minor games (Q271623) (← links)
- Picker-chooser fixed graph games (Q273174) (← links)
- The graph distance game and some graph operations (Q283692) (← links)
- Creating cycles in walker-breaker games (Q284747) (← links)
- Economical extremal hypergraphs for the Erdős-Selfridge theorem (Q297937) (← links)
- An \(n\)-in-a-row type game (Q311490) (← links)
- Winning fast in fair biased maker-breaker games (Q322263) (← links)
- A non-trivial upper bound on the threshold bias of the oriented-cycle game (Q345067) (← links)
- Disproof of the neighborhood conjecture with implications to SAT (Q377802) (← links)
- Avoider-Enforcer games played on edge disjoint hypergraphs (Q394298) (← links)
- Avoider-forcer games on hypergraphs with small rank (Q405059) (← links)
- The topology of competitively constructed graphs (Q405221) (← links)
- Biased orientation games (Q418878) (← links)
- Fast embedding of spanning trees in biased maker-breaker games (Q427795) (← links)
- Client-waiter games on complete and random graphs (Q504971) (← links)
- Generalized pairing strategies -- a bridge from pairing strategies to colorings (Q508633) (← links)
- Strong games played on random graphs (Q510354) (← links)
- Transitive avoidance games (Q521391) (← links)
- Global maker-breaker games on sparse graphs (Q616371) (← links)
- Hamilton cycles in highly connected and expanding graphs (Q624184) (← links)
- On the clique-game (Q649002) (← links)
- Maker-Breaker domination game (Q776271) (← links)
- Fast winning strategies in avoider-enforcer games (Q844236) (← 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)
- Fraternal augmentations, arrangeability and linear Ramsey numbers (Q1039442) (← links)
- Random strategies are nearly optimal for generalized van der Waerden games (Q1690015) (← links)
- Winning fast in biased maker-breaker games (Q1690027) (← links)
- Maker-breaker percolation games. II: Escaping to infinity (Q1984532) (← links)
- Waiter-client triangle-factor game on the edges of the complete graph (Q2033901) (← 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)
- On the WalkerMaker-WalkerBreaker games (Q2181217) (← links)
- Maker-breaker total domination game (Q2185735) (← links)
- Fast strategies in Waiter-Client games (Q2200433) (← links)
- Upper bounds on positional Paris-Harrington games (Q2222955) (← links)
- Game saturation of intersecting families (Q2248514) (← links)
- Keeping avoider's graph almost acyclic (Q2260635) (← links)
- On solving the 7,7,5-game and the 8,8,5-game (Q2310749) (← 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)
- Proper 2-coloring game on some trees (Q2420567) (← links)
- Weak and strong \(k\)-connectivity games (Q2509746) (← links)
