Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs (Q2178745)
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 7198751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs |
scientific article; zbMATH DE number 7198751 |
Statements
Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs (English)
0 references
11 May 2020
0 references
chromatic completion
0 references
perfect lucky 3-coloring
0 references
lucky 3-polynomial
0 references
0.6838265657424927
0 references
0.6666683554649353
0 references
0.6656357645988464
0 references
0.6641664505004883
0 references
