Complexity of maker-breaker games on edge sets of graphs (Q6657252)
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: Complexity of maker-breaker games on edge sets of graphs |
scientific article; zbMATH DE number 7962112
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of maker-breaker games on edge sets of graphs |
scientific article; zbMATH DE number 7962112 |
Statements
Complexity of maker-breaker games on edge sets of graphs (English)
0 references
6 January 2025
0 references
maker-breaker games
0 references
\(H\)-game
0 references
perfect matching game
0 references
\( \mathsf{PSPACE} \)-hard
0 references
\( \mathsf{FPT} \)
0 references
computational complexity
0 references
0 references
