Sciweavers

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

11

COMBINATORICA
1998

favoriteEmaildiscussreport

77views more COMBINATORICA 1998»

A Bound on the Total Chromatic Number

13 years 4 months ago

A Bound on the Total Chromatic Number

Download tspace.library.utoronto.ca

We prove that the total chromatic number of any graph with maximum degree is at most plus an absolute constant. In particular, we show that for su ciently large, the total chromatic number of such a graph is at most + 1026. The proof is probabilistic.

Michael Molloy, Bruce A. Reed

Real-time Traffic

Absolute Constant | COMBINATORICA 1998 | Maximum Degree | Total Chromatic Number |

claim paper

Related Content

» Total and fractional total colourings of circulant graphs

» A study of the total chromatic number of equibipartite graphs

» The incidence game chromatic number

» On the packing chromatic number of Cartesian products hexagonal lattice and trees

» Copositive programming motivated bounds on the stability and the chromatic numbers

» On Sum Coloring of Graphs with Parallel Genetic Algorithms

» Total chromatic number of planar graphs with maximum degree ten

» Forbidden Subgraph Colorings and the Oriented Chromatic Number

» Bar kVisibility Graphs Bounds on the Number of Edges Chromatic Number and Thickness

Post Info
More Details (n/a)

Added	21 Dec 2010
Updated	21 Dec 2010
Type	Journal
Year	1998
Where	COMBINATORICA
Authors	Michael Molloy, Bruce A. Reed

Comments (0)