Determining the total colouring number is np-hard
Author:
- Abdón Sánchez-ArroyoASAbdón Sánchez-Arroyo
- 1 January 1989
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 78 (3) , 315-319
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- NP completeness of finding the chromatic index of regular graphsJournal of Algorithms, 1983
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981