Almost all k-colorable graphs are easy to color (Q3811723): 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.1016/0196-6774(88)90005-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083883919 / rank | |||
Normal rank | |||
Latest revision as of 18:21, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost all k-colorable graphs are easy to color |
scientific article |
Statements
Almost all k-colorable graphs are easy to color (English)
0 references
1988
0 references
random graph
0 references
k-colorable graphs
0 references
Brelaz' algorithm
0 references
