Determining the total colouring number i
β
AbdΓ³n SΓ‘nchez-Arroyo
π
Article
π
1989
π
Elsevier Science
π
English
β 279 KB
In this paper it is proved that the problem of deteruzining the totai chromatic number of an arbitrary'graph is NP-hard. The problem remains NP-hard even for cubic bipartite graphs.