Recent developments in total colouring

✍ Scribed by H.R. Hind

• Publisher: Elsevier Science
• Year: 1994
• Tongue: English
• Weight: 457 KB
• Volume: 125
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(94)90162-7

✦ Synopsis

This paper gives a number of recent results concerning total colourings and suggests that recolouring schemes which are somewhat more complex than those currently being considered, need to be developed. Some examples of graphs and colourings which support this assertion are presented.

The aim of this paper is firstly to publicise a number of recent results concerning total colourings and secondly to suggest that recolouring schemes which are somewhat more complex than those currently being considered, need to be developed. Some examples which support this assertion will be presented. All graphs considered in this paper will be finite, simple graphs. As is conventional when discussing colourings of finite graphs, the sets of colours considered in this paper will be subsets of the set N of positive integers.