Finding shortest paths between graph colourings (Q309791)
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: Finding shortest paths between graph colourings |
scientific article; zbMATH DE number 6624620
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding shortest paths between graph colourings |
scientific article; zbMATH DE number 6624620 |
Statements
Finding shortest paths between graph colourings (English)
0 references
7 September 2016
0 references
graph colouring
0 references
graph algorithms
0 references
reconfigurations
0 references
reconfiguration graphs
0 references
fixed parameter tractability
0 references
0 references
