✦ LIBER ✦
Almost all graphs with average degree 4 are 3-colorable
✍ Scribed by Dimitris Achlioptas; Cristopher Moore
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 323 KB
- Volume
- 67
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
✦ Synopsis
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., Gðn; p ¼ d=nÞ; are 3-colorable and that a constant fraction of all 4-regular graphs are 3-colorable.
📜 SIMILAR VOLUMES