Graphs with small chromatic numbers are easy to color
- 13 March 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 30 (5) , 233-236
- https://doi.org/10.1016/0020-0190(89)90200-7
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Almost all k-colorable graphs are easy to colorJournal of Algorithms, 1988