Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. |
scientific article; zbMATH DE number 1857090
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. |
scientific article; zbMATH DE number 1857090 |
Statements
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (English)
0 references
21 January 2003
0 references
complexity theory
0 references
avoidance games
0 references
edge coloring
0 references
generalized Ramsey theory
0 references
graph Ramsey theory
0 references
Sim
0 references
PSPACE-completeness
0 references
