Coloring 3-colorable graphs with \(o(n^{1/5})\) colors (Q2965508)
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: Coloring 3-colorable graphs with o(n^1/5) colors |
scientific article; zbMATH DE number 6691424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring 3-colorable graphs with \(o(n^{1/5})\) colors |
scientific article; zbMATH DE number 6691424 |
Statements
3 March 2017
0 references
approximation algorithms
0 references
graph coloring
0 references
Coloring 3-colorable graphs with o(n 1/5 ) colors (English)
0 references
0.9375623464584352
0 references
0.8516035079956055
0 references
0.8516035079956055
0 references
0.8401491045951843
0 references
0.8358940482139587
0 references
