A recolouring problem on undirected graphs (Q5483561)
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: A recolouring problem on undirected graphs |
scientific article; zbMATH DE number 5046160
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A recolouring problem on undirected graphs |
scientific article; zbMATH DE number 5046160 |
Statements
15 August 2006
0 references
2-colouring
0 references
recolouring algorithm
0 references
0.7577183246612549
0 references
0.7345136404037476
0 references
0.7290185689926147
0 references
