Time optimal \(d\)-list colouring of a graph (Q3569740)
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: Time optimal d-list colouring of a graph |
scientific article; zbMATH DE number 5724118
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time optimal \(d\)-list colouring of a graph |
scientific article; zbMATH DE number 5724118 |
Statements
Time Optimal d-List Colouring of a Graph (English)
0 references
22 June 2010
0 references
0.8404775261878967
0 references
0.8238766193389893
0 references
0.7780752778053284
0 references
0.767120897769928
0 references
0.7666899561882019
0 references
