Paths between colourings of graphs with bounded tree-width (Q1721933)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7021529
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Paths between colourings of graphs with bounded tree-width |
scientific article; zbMATH DE number 7021529 |
Statements
Paths between colourings of graphs with bounded tree-width (English)
0 references
13 February 2019
0 references
combinatorial problems
0 references
reconfiguration graph
0 references
graph colouring
0 references
tree-width
0 references
0.8782705664634705
0 references
0.8388697504997253
0 references
0.8081486821174622
0 references
0.8063521385192871
0 references
0.8051776885986328
0 references
