Why almost all \(k\)-colorable graphs are easy to color (Q968270)
From MaRDI portal
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
