Keeping avoider's graph almost acyclic
From MaRDI portal
Publication:2260635
zbMath1312.91024arXiv1403.1482MaRDI QIDQ2260635
Publication date: 11 March 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.1482
2-person games (91A05) Games involving graphs (91A43) Planar graphs; geometric and topological aspects of graph theory (05C10) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (3)
Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ On the odd cycle game and connected rules ⋮ On the separation conjecture in avoider-enforcer games
Cites Work
- Unnamed Item
- Hamiltonian games
- Avoider-enforcer: the rules of the game
- A matching game
- Ramsey games
- A Hamiltonian game on \(K_{n,n}\)
- Avoider-Enforcer games
- Planarity, Colorability, and Minor Games
- Remarks on positional games. I
- Biased Positional Games
- Combinatorial Games
- A Solution of the Shannon Switching Game
- Biased positional games for which random strategies are nearly optimal
This page was built for publication: Keeping avoider's graph almost acyclic
