TOTAL CHROMATIC NUMBER OF COMPLETE R-PARTITE GRAPHS

被引：8

作者：

CHEW, KH

YAP, HP

机构：

[1] Department of Mathematics, National University of Singapore

来源：

JOURNAL OF GRAPH THEORY | 1992年 / 16卷 / 06期

关键词：

D O I：

10.1002/jgt.3190160608

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Rosenfeld (1971) proved that the Total Colouring Conjecture holds for balanced complete r-partite graphs. Bermond (1974) determined the exact total chromatic number of every balanced complete r-partite graph. Rosenfeld's result had been generalized recently to complete r-partite graphs by Yap (1 989). The main result of this paper is to prove that the total chromatic number of every complete r-partite graph G of odd order is DELTA(G) + 1. This result gives a partial generalization of Bermond's theorem.

引用

页码：629 / 634

页数：6

共 10 条

[1]

Behzad M., 1965, GRAPHS THEIR CHROMAT

[2]

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

[3]

BERMOND JC, 1974, J LOND MATH SOC, V9, P279

[4] TOTAL COLORING OF CERTAIN GRAPHS [J].

ROSENFELD, M .

ISRAEL JOURNAL OF MATHEMATICS, 1971, 9 (03) :396-+

[5]

Vizing V.G., 1968, RUSSIAN MATH SURVEYS, V23, P117

[6]

Vizing V. G., 1964, DISKRET ANAL, V3, P25

[7]

Yap H, 1986, SOME TOPICS GRAPH TH

[8] TOTAL COLORINGS OF GRAPHS [J].

YAP, HP .

BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 1989, 21 :159-163

[9]

YAP HP, 1989, J AUSTR MATH SOC A, V547, P445

[10]

YAP HP, UNPUB TOTAL CHROMATI

← 1 →