Coloring complete and complete bipartite graphs from random lists (Q292251)
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 6592577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring complete and complete bipartite graphs from random lists |
scientific article; zbMATH DE number 6592577 |
Statements
Coloring complete and complete bipartite graphs from random lists (English)
0 references
13 June 2016
0 references
list coloring
0 references
random list
0 references
coloring from random lists
0 references
complete graph
0 references
complete bipartite graph
0 references
0.9428775906562804
0 references
0.8903865218162537
0 references
0.8829517960548401
0 references
0.8708359599113464
0 references
0.8600522875785828
0 references
