Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

STOC
2002
ACM

favoriteEmaildiscussreport

121views Algorithms» more STOC 2002»

Almost all graphs with average degree 4 are 3-colorable

14 years 4 months ago

Almost all graphs with average degree 4 are 3-colorable

Download users.soe.ucsc.edu

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

Real-time Traffic

4-regular Graphs | Algorithms | Sparse Random Graphs | STOC 2002 |

claim paper

Related Content

» Large Topological Cliques in Graphs Without a 4Cycle

» Injective colorings of graphs with low average degree

» Coloring Eulerian triangulations of the projective plane

» Injective colorings of sparse graphs

» Rumor Spreading on Random Regular Graphs and Expanders

» On the Minimum Load Coloring Problem

» Constant Depth Circuits Fourier Transform and Learnability

» Is LightTree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Network...

» Gowers uniformity influence of variables and PCPs

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2002
Where	STOC
Authors	Dimitris Achlioptas, Cristopher Moore

Comments (0)