A result on the total colouring of powers of cycles

Authors:
C. N. Campos;C. P. de Mello
Affiliations:
Instituto de Computação, Universidade Estadual de Campinas, Campinas, Brazil;Instituto de Computação, Universidade Estadual de Campinas, Campinas, Brazil
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 4
Cited 3

Determining the total colouring number is NP-hard

Discrete Mathematics
Total colouring regular bipartite graphs is NP-hard

Proceedings of the first Malta conference on Graphs and combinatorics
Total-chromatic number and chromatic index of dually chordal graphs

Information Processing Letters
On planarity and colorability of circulant graphs

Discrete Mathematics

Equitable total coloring of Cm Cn

Discrete Applied Mathematics
Computing square roots of trivially perfect and threshold graphs

Discrete Applied Mathematics
The hunting of a snark with total chromatic number 5

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

The total chromatic number @g"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, @g"T(G)=