Graph Ramsey games

zbMath1001.91011arXivcs/9911004MaRDI QIDQ4536688

Wolfgang Slany

Publication date: 12 December 2002

Full work available at URL: https://arxiv.org/abs/cs/9911004

zbMATH Keywords

complexityedge coloringcombinatorial gamesPSPACE-completenessgraph Ramsey theorywinning strategyavoidance gameJava appletachievement gameRamsey gameendgamesgame of Sim

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Combinatorial games (91A46)

Related Items (5)

Upper bounds on positional Paris-Harrington games ⋮ Transitive avoidance games ⋮ Unnamed Item ⋮ Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. ⋮ On strong avoiding games

This page was built for publication: Graph Ramsey games