Approximation results for the minimum graph coloring problem
- 8 April 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 50 (1) , 19-23
- https://doi.org/10.1016/0020-0190(94)90039-6
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Covering edges by cliques with regard to keyword conflicts and intersection graphsCommunications of the ACM, 1978