Sciweavers

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

11

CPC
2007

favoriteEmaildiscussreport

101views more CPC 2007»

Colouring Random 4-Regular Graphs

13 years 4 months ago

Colouring Random 4-Regular Graphs

Download www.math.uwaterloo.ca

We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an eﬃcient algorithm which a.a.s. 3colours a random 4-regular graph. The analysis includes use of the diﬀerential equation method, and exponential bounds on the tail of random variables associated with branching processes. A substantial part of the analysis applies to random d-regular graphs in general.

Lingsheng Shi, Nicholas C. Wormald

Real-time Traffic

CPC 2007 | Diﬀerential Equation Method | Number 3 | Random 4-regular Graph |

claim paper

Related Content

» NeighbourDistinguishing Edge Colourings of Random Regular Graphs

» Colouring Random Regular Graphs

» Almost all graphs with average degree 4 are 3colorable

» Graph Theory

» Total and fractional total colourings of circulant graphs

» Improper colouring of random unit disk graphs

» Approximating Circular Arc Colouring and Bandwidth Allocation in AllOptical Ring Networks

» Martingales on Trees and the Empire Chromatic Number of Random Trees

» On randomly colouring locally sparse graphs

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CPC
Authors	Lingsheng Shi, Nicholas C. Wormald

Comments (0)