Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:11, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. |
scientific article |
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
