Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete.
type: Item
instance of: scholarly article
title: Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete.
zbMATH Open document ID: 1061.05090
DOI: 10.1016/S0304-3975(01)00179-7
author: Wolfgang Slany
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1857090
zbMATH Keywords: complexity theory
zbMATH Keywords: avoidance games
zbMATH Keywords: edge coloring
zbMATH Keywords: generalized Ramsey theory
zbMATH Keywords: graph Ramsey theory
zbMATH Keywords: Sim
zbMATH Keywords: PSPACE-completeness
MaRDI profile type: Publication
cites work: Alternation
cites work: Generalized Ramsey theory for graphs
cites work: Q4056030
cites work: Q4071274
cites work: On a combinatorial game
cites work: A Combinatorial Problem Which Is Complete in Polynomial Space
cites work: The Pebbling Problem is Complete in Polynomial Space
cites work: Combinatorial Relations and Chromatic Graphs
cites work: The Othello game on an \(n\times n\) board is PSPACE-complete
cites work: GO Is Polynomial-Space Hard
cites work: Subgraph counting identities and Ramsey numbers
cites work: Playing disjunctive sums is polynomial space complete
cites work: Games against nature
cites work: Small Ramsey numbers
cites work: Gobang is PSPACE-complete
cites work: Hex ist Pspace-vollständig. (Hex is Pspace-complete)
cites work: On the complexity of some two-person perfect-information games
cites work: Q3433898
cites work: Graph Ramsey games
cites work: Q4223779
description: scientific article; zbMATH DE number 1857090