Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances (Q3525616)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances |
scientific article |
Statements
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances (English)
0 references
17 September 2008
0 references
vertex-recolouring
0 references
colour graph
0 references
PSPACE-complete
0 references
superpolynomial distance
0 references
