An algorithm for 3-colorable graphs
- 1 January 1997
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 61 (1) , 49-53
- https://doi.org/10.1016/s0020-0190(96)00190-1
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- New approximation algorithms for graph coloringJournal of the ACM, 1994
- Ramsey numbers and an approximation algorithm for the vertex cover problemActa Informatica, 1985
- Improving the performance guarantee for approximate graph coloringJournal of the ACM, 1983