THE TOTAL CHROMATIC NUMBER OF GRAPHS HAVING LARGE MAXIMUM DEGREE

被引：24

作者：

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

共 21 条

[1]

Behzad M., 1965, THESIS MICHIGAN STAT

[2]

BEHZAD M, 1967, J LOND MATH SOC, V42, P225

[3]

Bollobas B., 1979, GRAPH THEORY INTRO C

[4]

Bollobas B., 2004, EXTREMAL GRAPH THEOR

CHETWYND, AG ;

HILTON, AJW .

[6]

CHETWYND AG, 1991, J LOND MATH SOC, V44, P193

[7]

CHETWYND AG, 1990, GRAPH COLOURINGS, P65

[8] HAMILTONISM, DEGREE SUM AND NEIGHBORHOOD INTERSECTIONS [J].

FLANDRIN, E ;

JUNG, HA ;

LI, H .

[9]

Hajnal A., 1970, COMBIN THEORY APPL, VII, P601

[10] AN UPPER BOUND FOR THE TOTAL CHROMATIC NUMBER OF DENSE GRAPHS [J].

HIND, HR .