NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique Chord

Raphael Machado, Celina M. Herrera de Figueiredo. NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique Chord. In Sonia Cafieri, Antonio Mucherino, Giacomo Nannicini, Fabien Tarissan, Leo Liberti, editors, Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009. pages 55-59, 2009. [doi]

Abstract

Abstract is missing.