Sciweavers

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

60

Voted

CPC
2008

favoriteEmaildiscussreport

60views more CPC 2008»

On the Maximum Degree of a Random Planar Graph

14 years 9 months ago

On the Maximum Degree of a Random Planar Graph

Download cgm.cs.mcgill.ca

Colin McDiarmid, Bruce A. Reed

Real-time Traffic

CPC 2008 |

claim paper

Related Content

» Randomly coloring planar graphs with fewer colors than the maximum degree

» Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems

» How randomized search heuristics find maximum cliques in planar graphs

» Total chromatic number of planar graphs with maximum degree ten

» Total coloring of planar graphs of maximum degree eight

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

» On the Degree Sequences of Random Outerplanar and SeriesParallel Graphs

» New LinearTime Algorithms for EdgeColoring Planar Graphs

» Independent sets in trianglefree cubic planar graphs

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	CPC
Authors	Colin McDiarmid, Bruce A. Reed

Comments (0)