A bound on the total chromatic number

被引：67

作者：

Molloy, M ^{[1
]}

Reed, B

机构：

[1] Univ Toronto, Dept Comp Sci, Toronto, ON, Canada

[2] Univ Paris 06, CNRS, Equipe Combinatoire, Paris, France

来源：

COMBINATORICA | 1998年 / 18卷 / 02期

关键词：

AMS Subject Classification (1991) Classes: 05C15;

D O I：

10.1007/PL00009820

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove that the total chromatic number of any graph with maximum degree Delta is at most Delta plus an absolute constant. In particular, we show that for a sufficiently large, the total chromatic number of such a graph is at most Delta+10(26). The proof is probabilistic.

引用

页码：241 / 280

页数：40