Maximizing the number of unused colors in the vertex coloring problem
- 1 October 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 52 (2) , 87-90
- https://doi.org/10.1016/0020-0190(94)00113-8
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Approximation results for the minimum graph coloring problemInformation Processing Letters, 1994
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973