Total Colourings of Graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1989 English Publisher:WileyJournal:Bulletin of the London Mathematical Society, volume 21, pages 159-163 (issn: 0024-6093,

Copyright policy )

Authors: Yap, H. P.;

doi: 10.1112/blms/21.2.159

Total Colourings of Graphs

- Summary
- Subjects
- Metrics

Abstract

We prove that the TCC (Total Colouring Conjecture) is true for complete r-partite graphs which extends a result of M. Rosenfeld. We also give an alternate, slightly simpler proof of an earlier result (which says that the TCC is true for graphs having maximum degree 3) obtained independently by M. Rosenfeld and N. Vijayaditya.

Related Organizations

National University of Singapore
Singapore

Keywords

Coloring of graphs and hypergraphs, total chromatic number, total colouring conjecture, TCC

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	17
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average