The complexity of free-flood-it on \(2\times n\) boards (Q388453)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of free-flood-it on \(2\times n\) boards |
scientific article |
Statements
The complexity of free-flood-it on \(2\times n\) boards (English)
0 references
19 December 2013
0 references
computational complexity
0 references
graph colouring
0 references
fixed parameter tractability
0 references
