Coloring 3-Colorable Graphs with Less than <i>n</i> <sup>1/5</sup> Colors (Q3177885): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/3001582 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2600945321 / rank | |||
Normal rank | |||
Latest revision as of 02:04, 20 March 2024
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
