Sciweavers

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

76

Voted

STOC
2007
ACM

favoriteEmaildiscussreport

110views Algorithms» more STOC 2007»

Randomly coloring planar graphs with fewer colors than the maximum degree

15 years 10 months ago

Randomly coloring planar graphs with fewer colors than the maximum degree

Download www.cc.gatech.edu

Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda

Real-time Traffic

Algorithms | Planar Graphs | STOC 2007 |

claim paper

Related Content

» Randomly coloring sparse random graphs with fewer colors than the maximum degree

» New LinearTime Algorithms for EdgeColoring Planar Graphs

» Total coloring of planar graphs of maximum degree eight

» Coloring squares of planar graphs with girth six

» Randomly Coloring Constant Degree Graphs

» Coloring powers of planar graphs

» Graph coloring with no large monochromatic components

» Adapted List Coloring of Graphs and Hypergraphs

» Sum Coloring of Bipartite Graphs with Bounded Degree

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda

Comments (0)