THE TOTAL CHROMATIC NUMBER OF GRAPHS HAVING LARGE MAXIMUM DEGREE

被引:23
|
作者
HILTON, AJW [1 ]
HIND, HR [1 ]
机构
[1] UNIV READING,DEPT MATH,WHITEKNIGHTS,POB 220,READING RG6 2AX,ENGLAND
关键词
D O I
10.1016/0012-365X(93)90329-R
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The total colouring conjecture is shown to be correct for those graphs G having DELTA(G) greater-than-or-equal-to 3/4\V(G)\.
引用
下载
收藏
页码:127 / 140
页数:14
相关论文
共 50 条