Sciweavers

STOC
2002
ACM

Almost all graphs with average degree 4 are 3-colorable

15 years 7 days ago
Almost all graphs with average degree 4 are 3-colorable
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. r 2003 Elsevier Inc. All rights reserved.
Dimitris Achlioptas, Cristopher Moore
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2002
Where STOC
Authors Dimitris Achlioptas, Cristopher Moore
Comments (0)