A result on the total colouring of powers of cycles
Authors:
- C.N. CamposCCC.N. Campos
- C.P. de MelloCMC.P. de Mello
- 1 March 2007
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 155 (5) , 585-597
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On planarity and colorability of circulant graphsDiscrete Mathematics, 2003
- Total-chromatic number and chromatic index of dually chordal graphsInformation Processing Letters, 1999
- Total colouring regular bipartite graphs is NP-hardDiscrete Mathematics, 1994
- Determining the total colouring number is np-hardDiscrete Mathematics, 1989
- The Colour Numbers of Complete GraphsJournal of the London Mathematical Society, 1967