Coloring 3-Colorable Graphs with Less than <i>n</i> <sup>1/5</sup> Colors (Q3177885)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coloring 3-Colorable Graphs with Less than <i>n</i> <sup>1/5</sup> Colors |
scientific article |
Statements
Coloring 3-Colorable Graphs with Less than <i>n</i> <sup>1/5</sup> Colors (English)
0 references
2 August 2018
0 references
3-colorable graphs
0 references
combinatorial algorithm
0 references
