"NP-Completeness of Determining the Total Chromatic Number of Graphs that ..."

Raphael Machado, Celina M. H. de Figueiredo (2009)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2017-02-02

- view
  - electronic edition @ polytechnique.fr
- export record
  dblp key:
  - conf/colognetwente/MachadoF09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/colognetwente/MachadoF09
Raphael Machado, Celina M. H. de Figueiredo:
NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique Chord. CTW 2009: 55-59

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.