On the complexity of the general coloring problem
- 30 November 1981
- journal article
- Published by Elsevier in Information and Control
- Vol. 51 (2) , 128-145
- https://doi.org/10.1016/s0019-9958(81)90226-6
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Color-families are denseTheoretical Computer Science, 1982
- Colorings and interpretations: a connection between graphs and grammar formsDiscrete Applied Mathematics, 1981
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- Grammar and L forms: An introductionPublished by Springer Nature ,1980