An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\) (Q6038583)
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: An improved lower bound of P(G,L)-P(G,k) for k-assignments L |
scientific article; zbMATH DE number 7681176
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\) |
scientific article; zbMATH DE number 7681176 |
Statements
An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\) (English)
0 references
2 May 2023
0 references
list-coloring
0 references
list-color function
0 references
chromatic polynomial
0 references
broken-cycle
0 references
0.7953023910522461
0 references
0.7810311317443848
0 references
0.7712933421134949
0 references
0.7693577408790588
0 references
0.7693577408790588
0 references
