Finding Paths between Graph Colourings: Computational Complexity and Possible Distances (Q3503504)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Paths between Graph Colourings: Computational Complexity and Possible Distances |
scientific article |
Statements
Finding Paths between Graph Colourings: Computational Complexity and Possible Distances (English)
0 references
5 June 2008
0 references
colour graph
0 references
PSPACE-completeness
0 references
superpolynomial paths
0 references
0 references
