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|
de Mello C.P.
|Abstract:||The total chromatic number χT (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, χT (G) ≤ Δ(G)+2. This work verifies the TCC for powers of cycles Cnk, n even and 2 < k < ⌊n/2⌋, showing that there exists and can be polynomially constructed a (Δ(G) + 2)-total colouring for these graphs. © 2004 Elsevier B.V. All rights reserved.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.