@dblp

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

, and . CTW, page 55-59. (2009)

Links and resources

Tags