Why almost all \(k\)-colorable graphs are easy to color (Q968270): 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.1007/s00224-009-9231-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2170487340 / rank | |||
Normal rank | |||
Revision as of 00:36, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Why almost all \(k\)-colorable graphs are easy to color |
scientific article |
Statements
Why almost all \(k\)-colorable graphs are easy to color (English)
0 references
5 May 2010
0 references
average case analysis
0 references
\(k\)-colorability
0 references
random graphs
0 references
spectral analysis
0 references
