Almost all graphs with average degree 4 are 3-colorable (Q5917586): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:01, 1 February 2024
scientific article; zbMATH DE number 2116464
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost all graphs with average degree 4 are 3-colorable |
scientific article; zbMATH DE number 2116464 |
Statements
Almost all graphs with average degree 4 are 3-colorable (English)
0 references
18 November 2004
0 references
Random graphs
0 references
Regular random graphs
0 references
Graph coloring
0 references
Threshold phenomena
0 references
