Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: A result on the total colouring of powers of cycles
Author: Campos, CN
de Mello, CP
Abstract: The total chromatic number XT(G) is the least number of colours needed to colour the vertices and edges of a graph G such that no incident or adjacent elements (vertices or edges) receive the same colour. The Total Colouring Conjecture (TCC) states that for every simple graph G. chi T(G) <= Delta 1 (G) + 2. This work verifies the TCC for powers of cycles C-n(k), n even and 2 < k < n/2, showing that there exists and can be polynomially constructed a (Delta (G) + 2)-total colouring for these graphs. (c) 2006 Elsevier B.V. All rights reserved.
Subject: total colourings
total colouring conjecture
total chromatic number
powers of cycles
Country: Holanda
Editor: Elsevier Science Bv
Rights: fechado
Identifier DOI: 10.1016/j.dam.2006.08.010
Date Issue: 2007
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000245504100001.pdf283.46 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.